Access the full text.
Sign up today, get DeepDyve free for 14 days.
Henry Kautz, Yongshao Ruan, D. Achlioptas, C. Gomes, B. Selman, M. Stickel (2001)
Balance and Filtering in Structured Satisfiable Problems
M. Velev, R. Bryant (2001)
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW
Joao Marques-Silva, L. Silva (1999)
Solving satisfiability in combinational circuits with backtrack search and recursive learningProceedings. XII Symposium on Integrated Circuits and Systems Design (Cat. No.PR00387)
R. Béjar, F. Manyà (1999)
A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas
R. Haralick, G. Elliott (1979)
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
F. Manyà, R. Béjar, G. Escalada-Imaz (1998)
The satisfiability problem in regular CNF-formulasSoft Computing, 2
R. Béjar, Alba Cabiscol, C. Fernández, F. Manyà, C. Gomes (2001)
Capturing Structure with Satisfiability
R. Béjar, F. Manyà (2000)
Solving the Round Robin Problem Using Propositional Logic
H.A. Kautz, B. Selman (1996)
Proceedings of the 14th National Conference on Artificial Intelligence, AAAI’96, Portland, OR
Joao Marques-Silva (1999)
Algorithms for Satisfiability in Combinational Circuits Based on Backtrack Search and Recursive Learning
Chu Li, Anbulagan (1997)
Look-Ahead Versus Look-Back for Satisfiability Problems
M. Moskewicz, Conor Madigan, Ying Zhao, Lintao Zhang, S. Malik (2001)
Chaff: engineering an efficient SAT solverProceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
C. Ansótegui, J. Larrubia, Chu Li, F. Manyà (2003)
Mv-Satz: A SAT solver for many-valued clausal forms
R. Béjar, R. Hähnle, F. Manyà (2001)
Proceedings, 31st International Symposium on Multiple-Valued Logics (ISMVL), Warsaw, Poland
Chu Li, Anbu Anbulagan (1997)
Heuristics Based on Unit Propagation for Satisfiability Problems
M. Velev, R. Bryant (2001)
Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessorsProceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
Barbara Smith, M. Dyer (1996)
Locating the Phase Transition in Binary Constraint Satisfaction ProblemsArtif. Intell., 81
R. Bayardo, R. Schrag (1997)
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
T. Walsh (2000)
Proceedings of the 6th International Conference on Principles of Constraint Programming, CP-2000, Singapore. LNCS, vol. 1894
B. Selman, Henry Kautz, Bram Cohen (1994)
Noise Strategies for Improving Local Search
B. Beckert, R. Hähnle, F. Manyà (1999)
Proceedings, International Symposium on Multiple-Valued Logics, ISMVL’99, Freiburg, Germany
R. Béjar, F. Manyà (2000)
Proceedings of the 17th National Conference on Artificial Intelligence, AAAI-2000, Austin, TX
Bernhard Beckert, Reiner Hähnle, F. Manyà (1999)
Transformations between signed and classical clause logicProceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)
(2002)
Resolution methods for manyvalued CNF formulas
Martin Davis, G. Logemann, D. Loveland (2011)
A machine program for theorem-provingCommun. ACM, 5
Joao Marques-Silva, K. Sakallah (1999)
GRASP: A Search Algorithm for Propositional SatisfiabilityIEEE Trans. Computers, 48
B. Selman, H. Levesque, D. Mitchell (1992)
Proceedings of the 10th National Conference on Artificial Intelligence, AAAI’92, San Jose, CA
R. Génisson, Philippe Jégou (1996)
Davis and Putnam were Already Checking Forward
B. Selman, H.A. Kautz, B. Cohen (1994)
Proceedings of the 12th National Conference on Artificial Intelligence, AAAI’94, Seattle, WA
Bernhard Beckert, Reiner Hähnle, F. Manyà (2000)
The SAT problem of signed CNF formulas
(1999)
SATLIB: A collection of SAT tools and data
R. Béjar, Reiner Hähnle, F. Manyà (2001)
A modular reduction of regular logic to classical logicProceedings 31st IEEE International Symposium on Multiple-Valued Logic
Ian Gent (2002)
Arc Consistency in SAT
R. Béjar, F. Manyà (1999)
Proceedings of the 5th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU’99, London, England. LNAI, vol. 1638
T. Walsh (2000)
SAT v CSP
C.M. Li (1997)
Proceedings of the 3rd International Conference on Principles of Constraint Programming, CP’97, Linz, Austria. LNCS, vol. 1330
R. Béjar, A. Cabiscol, C. Fernández, F. Manyà, C.P. Gomes (2001)
7th International Conference on Principles and Practice of Constraint Programming, CP-2001, Paphos, Cyprus. LNCS, vol. 2239
Henry Kautz, B. Selman (1996)
Pushing the Envelope: Planning, Propositional Logic and Stochastic Search
B. Selman (1992)
A New Method for Solving Hard Satis ability Problems
C.M. Li (1997)
Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI’97, Nagoya, Japan
B. Beckert, R. Hähnle, F. Manyà (2000)
Labelled Deduction. Applied Logic Series, vol. 17
D. Basin, Marcello D'Agostino, D. Gabbay, S. Matthews, L. Viganò (2000)
Labelled deduction
M. Davis, H. Putnam (1960)
A computing procedure for quantification theoryJ. Assoc. Comput. Mach., 7
C. Bessiere, Jean-Charles Régin (2001)
Refining the Basic Constraint Propagation Algorithm
Martin Davis, H. Putnam (1960)
A Computing Procedure for Quantification TheoryJ. ACM, 7
Daniel Sabin, Eugene Freuder (1994)
Contradicting Conventional Wisdom in Constraint Satisfaction
C. Gomes (2002)
Solving Many-Valued SAT Encodings with Local Search
R.J. Bayardo, R.C. Schrag (1997)
Proceedings of the 14th National Conference on Artificial Intelligence, AAAI’97, Providence, RI
(1995)
Graph coloring page: The flat graph generator
We show that we can design and implement extremely efficient variable selection heuristics for SAT solvers by identifying, in Boolean clause databases, sets of Boolean variables that model the same multivalued variable and then exploiting that structural information. In particular, we define novel variable selection heuristics for two of the most competitive existing SAT solvers: Chaff, a solver based on look-back techniques, and Satz, a solver based on look-ahead techniques. Our heuristics give priority to Boolean variables that belong to sets of variables that model multivalued variables with minimum domain size in a given state of the search process. The empirical investigation conducted to evaluate the new heuristics provides experimental evidence that identifying multivalued knowledge in Boolean clause databases and using variable selection heuristics that exploit that knowledge leads to large performance improvements.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jun 23, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.