Data visualization tools for 3SAT instances

被引:0
|
作者
García-Ortegón, JM [1 ]
Torres-Jiménez, J [1 ]
机构
[1] ITESM Cuernavaca, AP 99-C, Cuernavaca 62490, Morelos, Mexico
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a set of data visualization tools that could lead to a better understanding of the conditions that make of a SAT instance a hard one. The visualization techniques included in this work are used to make evident the relationships between the SAT-variables in function of their distribution, signs and combinations of signs in the clauses. Using this information, the user may identify patterns associated with the hardness of a SAT instance which gives a more flexible measurement of the instance's hardness than just the relationship between the number of clauses (M) and the number of variables (N), It could be even possible to use the developed data visualization tools to determine if a specific solution method is best suitable for a specific SAT instance.
引用
收藏
页码:318 / +
页数:3
相关论文
共 50 条
  • [1] On strongly planar 3SAT
    Wu, Lidong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (01) : 293 - 298
  • [2] CONTEXTIAL INSERTION FOR #3SAT
    Subramaniam, G.
    Siromoney, Rani
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2006, (88): : 174 - 181
  • [3] Plasmids to solve #3SAT
    Siromoney, R
    Das, B
    ASPECTS OF MOLECULAR COMPUTING: ESSAYS DEDICATED TO TOM HEAD ON THE OCCASION OF HIS 70TH BIRTHDAY, 2004, 2950 : 361 - 366
  • [4] On strongly planar 3SAT
    Lidong Wu
    Journal of Combinatorial Optimization, 2016, 32 : 293 - 298
  • [5] A second order parameter for 3SAT
    Sandholm, TW
    PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, 1996, : 259 - 265
  • [6] Counting models for 2SAT and 3SAT formulae
    Dahllöf, V
    Jonsson, P
    Wahström, M
    THEORETICAL COMPUTER SCIENCE, 2005, 332 (1-3) : 265 - 291
  • [7] Visualizing the 3SAT to CLIQUE Reduction Process
    Marchetti, Kaden
    Bodily, Paul
    2022 INTERMOUNTAIN ENGINEERING, TECHNOLOGY AND COMPUTING (IETC), 2022,
  • [8] Hardness of Max 3SAT with no mixed clauses
    Guruswami, V
    Khot, S
    TWENTIETH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2005, : 154 - 162
  • [9] Secure set membership using 3SAT
    de Mare, Michael
    Wright, Rebecca N.
    INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 2006, 4307 : 452 - +
  • [10] AN EXACT TENSOR NETWORK FOR THE 3SAT PROBLEM
    Garcia-Saez, Artur
    Latorre, Jose I.
    QUANTUM INFORMATION & COMPUTATION, 2012, 12 (3-4) : 283 - 292