Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Armoni, Sergey Egorov, Ranan Fraer, Dmitry Korchemny, Moshe Vardi (2005)
Efficient LTL compilation for SAT-based model checkingICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.
Gilles Audemard, G. Katsirelos, Laurent Simon (2010)
A Restriction of Extended Resolution for Clause Learning SAT SolversProceedings of the AAAI Conference on Artificial Intelligence
Djamal Habet, Chu Li, L. Devendeville, Michel Vasquez (2002)
A Hybrid Approach for SAT
Allen Goldberg, P. Purdom, Cynthia Brown (1982)
Average Time Analyses of Simplified Davis-Putnam ProceduresInf. Process. Lett., 15
Chanseok Oh (2015)
Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary (2017)
A Distributed Version of Syrup
Gilles Audemard, Laurent Simon (2009)
Predicting Learnt Clauses Quality in Modern SAT Solvers
Aaron Bradley (2011)
SAT-Based Model Checking without Unrolling
E. Hirsch, Arist Kojevnikov (2005)
UnitWalk: A new SAT solver that uses local search guided by unit clause eliminationAnnals of Mathematics and Artificial Intelligence, 43
Paul Jackson, Daniel Sheridan (2004)
Clause Form Conversions for Boolean Circuits
G. Woeginger (2001)
Exact Algorithms for NP-Hard Problems: A Survey
M. Järvisalo, Armin Biere, Marijn Heule (2010)
Blocked Clause Elimination
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)
R. Reiter, J. Kleer (1987)
Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report
L. Kroc, Ashish Sabharwal, B. Selman (2007)
Survey Propagation RevisitedArXiv, abs/1206.5273
N. Eén, Niklas Sörensson (2003)
An Extensible SAT-solver
L. Simon (2001)
Multirésolution pour le test de consistance et la déduction en logique propositionnelle
E. Giunchiglia, Massimo Narizzano, A. Tacchella (2001)
Backjumping for Quantified Boolean Logic satisfiabilityArtif. Intell., 145
F. Koriche, Jean-Marie Lagniez, P. Marquis, Samuel Thomas (2013)
Knowledge Compilation for Model Counting: Affine Decision Trees
Z. Galil (1977)
On the Complexity of Regular Resolution and the Davis-Putnam ProcedureTheor. Comput. Sci., 4
Henry Kautz, B. Selman (2003)
Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search
Ran Raz (2002)
Resolution lower bounds for the weak pigeon hole principleProceedings 17th IEEE Annual Conference on Computational Complexity
Chu Li, Anbu Anbulagan (1997)
Heuristics Based on Unit Propagation for Satisfiability Problems
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Just-In-Time Compilation of Knowledge Bases
D. Pham, J. Thornton, A. Sattar (2007)
Building Structure into Local Search for SAT
E. Giunchiglia, Massimo Narizzano, A. Tacchella (2001)
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
H. Büning, Marek Karpinski, Andreas Flögel (1995)
Resolution for Quantified Boolean FormulasInf. Comput., 117
B. Selman, Henry Kautz, David McAllester (1997)
Ten Challenges in Propositional Reasoning and Search
Armin Biere, Marijn Heule, H. Maaren, T. Walsh (2009)
Handbook of satisfiability
D. Tompkins, H. Hoos (2004)
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT
O. Coudert, J. Madre (1992)
Implicit and incremental computation of primes and essential primes of Boolean functions[1992] Proceedings 29th ACM/IEEE Design Automation Conference
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, L. Sais (2009)
Learning in Local Search2009 21st IEEE International Conference on Tools with Artificial Intelligence
S. Bova (2016)
SDDs Are Exponentially More Succinct than OBDDs
R. Bryant (1989)
Graph-based Algorithm for Boolean Function ManipulationIEEE Transactions on Computers
Gilles Audemard, B. Benhamou, P. Siegel (2000)
AVAL: An Enumerative Method for SAT
T. Castell, C. Cayrol, M. Cayrol, Daniel Berre (1996)
Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models
O. Dubois, Gilles Dequen (2001)
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
S. Cook (1971)
The complexity of theorem-proving proceduresProceedings of the third annual ACM symposium on Theory of computing
Armin Biere, Florian Lonsing, M. Seidl (2011)
Blocked Clause Elimination for QBF
Bertrand Mazure, L. Sais, É. Grégoire (1998)
Boosting complete techniques thanks to local search methodsAnnals of Mathematics and Artificial Intelligence, 22
H. Hoos, T. Stützle (2004)
Stochastic Local Search: Foundations & Applications
O. Kullmann (1999)
On a Generalization of Extended ResolutionDiscret. Appl. Math., 96-97
J. Kleer, Alan Mackworth, R. Reiter (1992)
Characterizing Diagnoses and SystemsArtif. Intell., 56
Gilles Audemard, Laurent Simon (2014)
Lazy Clause Exchange Policy for Parallel SAT Solvers
Gilles Audemard, L. Bordeaux, Y. Hamadi, Saïd Jabbour, L. Sais (2008)
A Generalized Framework for Conflict Analysis
M. Järvisalo, Marijn Heule, Armin Biere (2012)
Inprocessing Rules
Knot Pipatsrisawat, Adnan Darwiche (2009)
On the Power of Clause-Learning SAT Solvers with Restarts
J. Doyle (1979)
A Truth Maintenance SystemArtif. Intell., 12
Marijn Heule, O. Kullmann, V. Marek (2016)
Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
Michael Cashmore, M. Fox, E. Giunchiglia (2012)
Planning as Quantified Boolean Formula
S. Cook (1976)
A short proof of the pigeon hole principle using extended resolutionSIGACT News, 8
Zack Newsham, Vijay Ganesh, S. Fischmeister, Gilles Audemard, Laurent Simon (2014)
Impact of Community Structure on SAT Solver Performance
B. Selman, Henry Kautz (1996)
Knowledge compilation and theory approximationJ. ACM, 43
Daniel Berre (2001)
Exploiting the real power of unit propagation lookaheadElectron. Notes Discret. Math., 9
B. Selman (1992)
A New Method for Solving Hard Satis ability Problems
R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, Lidror Troyansky (1999)
Determining computational complexity from characteristic ‘phase transitions’Nature, 400
J. Robinson (1965)
A Machine-Oriented Logic Based on the Resolution PrincipleJ. ACM, 12
R. Jeroslow, Jinchang Wang (1990)
Solving propositional satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 1
Marijn Heule (2017)
Schur Number FiveArXiv, abs/1711.08076
Adnan Darwiche, P. Marquis (2001)
A Perspective on Knowledge Compilation
Alvaro Val (2000)
Tractable Classes for Directional Resolution
Alvaro Val (1994)
Tractable Databases: How to Make Propositional Unit Resolution Complete Through Compilation
F. Lardeux, F. Saubion, Jin-Kao Hao (2006)
GASAT: A Genetic Local Search Algorithm for the Satisfiability ProblemEvolutionary Computation, 14
Alvaro Val (1999)
A New Method for Consequence Finding and Compilation in Restricted Languages
Sean Safarpour, Hratch Mangassarian, A. Veneris, Mark Liffiton, K. Sakallah (2007)
Improved Design Debugging Using Maximum SatisfiabilityFormal Methods in Computer Aided Design (FMCAD'07)
É. Grégoire, R. Ostrowski, Bertrand Mazure, L. Sais (2004)
Automatic Extraction of Functional Dependencies
Marco Cadoli, F. Donini (1997)
A Survey on Knowledge CompilationAI Commun., 10
A. Kean, George Tsiknis (1990)
An Incremental Method for Generating Prime Implicants/ImpicatesJ. Symb. Comput., 9
R. Shostak (1979)
A Practical Decision Procedure for Arithmetic with Function SymbolsJ. ACM, 26
M. Velev (2004)
Efficient translation of Boolean formulas to CNF in formal verification of microprocessorsASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)
I. Rish, R. Dechter (2000)
Resolution versus Search: Two Strategies for SATJournal of Automated Reasoning, 24
Bertrand Mazure, L. Sais, É. Grégoire (1997)
Tabu Search for SAT
V. Chvátal, E. Szemerédi (1988)
Many hard examples for resolutionJ. ACM, 35
R. Reiter (1986)
A Theory of Diagnosis from First PrinciplesArtif. Intell., 32
M. Luby, A. Sinclair, David Zuckerman (1993)
Optimal speedup of Las Vegas algorithms[1993] The 2nd Israel Symposium on Theory and Computing Systems
Armin Haken (1985)
The Intractability of ResolutionTheor. Comput. Sci., 39
S. Bova, Florent Capelli, S. Mengel, Friedrich Slivovsky (2015)
On Compiling CNFs into Structured Deterministic DNNFs
J. Liang, K. HariGovindV., P. Poupart, K. Czarnecki, Vijay Ganesh (2017)
An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate
Daniel Berre, Laurent Simon (2006)
Preface to the Special Volume on the SAT 2005 Competitions and EvaluationsJ. Satisf. Boolean Model. Comput., 2
Joao Marques-Silva, K. Sakallah (1996)
GRASP-A new search algorithm for satisfiabilityProceedings of International Conference on Computer Aided Design
B. Konev, A. Lisitsa (2014)
A SAT Attack on the Erdős Discrepancy Conjecture
Mikoláš Janota, William Klieber, Joao Marques-Silva, E. Clarke (2012)
Solving QBF with Counterexample Guided Refinement
N. Eén, Armin Biere (2005)
Effective Preprocessing in SAT Through Variable and Clause Elimination
Marijn Heule, W. Hunt, Nathan Wetzler (2013)
Trimming while checking clausal proofs2013 Formal Methods in Computer-Aided Design
Hantao Zhang (1997)
SATO: An Efficient Propositional Prover
Marijn Heule, O. Kullmann (2017)
The science of brute forceCommunications of the ACM, 60
Arthur Choi, N. Zaitlen, B. Han, Knot Pipatsrisawat, Adnan Darwiche, E. Eskin (2008)
Efficient Genome Wide Tagging by Reduction to SAT
J. Kleer (1992)
An Improved Incremental Algorithm for Generating Prime Implicates
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider (2017)
Dependency Learning for QBF
A. Coja-Oghlan (2014)
The asymptotic k-SAT thresholdProceedings of the forty-sixth annual ACM symposium on Theory of computing
Y. Hamadi, Saïd Jabbour, L. Sais (2009)
ManySAT: a Parallel SAT SolverJ. Satisf. Boolean Model. Comput., 6
Marijn Heule, H. Maaren (2007)
Effective Incorporation of Double Look-Ahead Procedures
J. Rintanen (1999)
Improvements to the Evaluation of Quantified Boolean Formulae
Rohan Fossé, Laurent Simon (2018)
On the Non-degeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers
D. Achlioptas, F. Ricci-Tersenghi (2009)
Random Formulas Have Frozen VariablesSIAM J. Comput., 39
B. Kernighan, Shou-De Lin (1970)
An efficient heuristic procedure for partitioning graphsBell Syst. Tech. J., 49
David Johnson (1982)
The NP-Completeness Column: An Ongoing GuideJ. Algorithms, 4
Mao Luo, Chu Li, Fan Xiao, F. Manyà, Zhipeng Lü (2017)
An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers
K. McMillan (2003)
Interpolation and SAT-Based Model Checking
H. Katebi, K. Sakallah, I. Markov (2010)
Symmetry and Satisfiability: An Update
S. Subbarayan, L. Bordeaux, Y. Hamadi (2007)
Knowledge Compilation Properties of Tree-of-BDDs
Allen Goldberg (2015)
On the Complexity of the Satisfiability Problem
Fausto Giunchiglia, R. Sebastiani (1996)
Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K
Martin Davis, G. Logemann, D. Loveland (2011)
A machine program for theorem-provingCommun. ACM, 5
S. Coste-Marquis, H. Fargier, J. Lang, Daniel Berre, P. Marquis (2006)
Representing Policies for Quantified Boolean Formulae
Benjamin Chambers, P. Manolios, D. Vroon (2009)
Faster SAT solving with better CNF generation2009 Design, Automation & Test in Europe Conference & Exhibition
W. Quine (1955)
A Way to Simplify Truth FunctionsAmerican Mathematical Monthly, 62
L. Kroc, Ashish Sabharwal, B. Selman (2010)
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
Knot Pipatsrisawat, Adnan Darwiche (2007)
A Lightweight Component Caching Scheme for Satisfiability Solvers
J. Kleer, B. Williams (1987)
Diagnosing Multiple FaultsArtif. Intell., 32
Guoqiang Pan, Moshe Vardi (2004)
Symbolic Decision Procedures for QBF
R. Ostrowski, É. Grégoire, Bertrand Mazure, L. Sais (2002)
Recovering and Exploiting Structural Knowledge from CNF Formulas
J. Franco (1986)
On the Probabilistic Performance of Algorithms for the Satisfiability ProblemInf. Process. Lett., 23
P. Tison (1967)
Generalization of Consensus Theory and Application to the Minimization of Boolean FunctionsIEEE Trans. Electron. Comput., 16
Software Tools for Technology Transfer manuscript No. (will be inserted by the editor) A Survey of Recent Advances in SAT-Based Formal Verification
D. Plaisted, Steven Greenbaum (1986)
A Structure-Preserving Clause Form TranslationJ. Symb. Comput., 2
W. Dowling, J. Gallier (1984)
Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn FormulaeJ. Log. Program., 1
J. Pearl (1982)
Reverend Bayes on Inference Engines: A Distributed Hierarchical ApproachProbabilistic and Causal Inference
J. Madre, O. Coudert (1991)
A Logically Complete Reasoning Maintenance System Based on a Logical Constraint Solver
Henry Kautz, B. Selman (1996)
Pushing the Envelope: Planning, Propositional Logic and Stochastic Search
E. Giunchiglia, Massimo Narizzano, A. Tacchella (2006)
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean FormulasArXiv, abs/1111.0860
Cédric Piette, Y. Hamadi, L. Sais (2008)
Vivifying Propositional Clausal Formulae
Marijn Heule, M. Seidl, Armin Biere (2016)
Solution Validation and Extraction for QBF PreprocessingJournal of Automated Reasoning, 58
E. Giunchiglia, Massimo Narizzano, A. Tacchella (2004)
Monotone Literals and Learning in QBF Reasoning
F. Bacchus, Jonathan Winter (2003)
Effective Preprocessing with Hyper-Resolution and Equality Reduction
Stephan Kottler (2010)
SAT Solving with Reference Points
Armin Biere, A. Cimatti, E. Clarke, Yunshan Zhu (1999)
Symbolic Model Checking without BDDs
Martin Davis, H. Putnam (1960)
A Computing Procedure for Quantification TheoryJ. ACM, 7
Marijn Heule (2018)
Computing Small Unit-Distance Graphs with Chromatic Number 5arXiv: Combinatorics
Jinbo Huang (2007)
The Effect of Restarts on the Efficiency of Clause Learning
Lintao Zhang, S. Malik (2002)
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
R. Letz (2002)
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
Marco Cadoli, A. Giovanardi, M. Schaerf (1998)
An Algorithm to Evaluate Quantified Boolean Formulae
A. Braunstein, M. Mézard, R. Zecchina (2002)
Survey propagation: An algorithm for satisfiabilityRandom Structures & Algorithms, 27
D. Mitchell, B. Selman, H. Levesque (1992)
Hard and Easy Distributions of SAT Problems
R. Dechter, I. Rish (1994)
Directional Resolution: The Davis-Putnam Procedure, Revisited
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence SDD: A New Canonical Representation of Propositional Knowledge Bases
B. Selman, Henry Kautz (1993)
Domain-independant extensions to GSAT : Solving large structured variables
[The Propositional Logic playsPropositional Logic a central role in Artificial Intelligence. Extremely simple, this logic already addresses some of the most important problems in computer theory. It allows an incredible panel of pragmatic solutions to be successfully applied on a large number of (theoretically) hard problems. Its apparent simplicity allows one to design very efficient and compactSimon, Laurent algorithms to tackle, in practice, problems lying at the first levels of the complexity classes. In this chapter, we first present the kind of A.I. problems that can typically be addressed by this formalism. Then, we present an historical view of the impressive progresses observed in the practical solving of the Satisfiability (SAT) problem. Then, we introduce the concept of Knowledge Compilation,Knowledge compilation another important field of A.I. often build upon Propositional Logic. We also introduce Quantified Boolean Formula (QBF), Quantified boolean formula a natural extension of SAT to quantifiers.]
Published: May 8, 2020
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.