Propositional Satisfiability and Constraint Programming: A comparative survey

Authors:
Lucas Bordeaux;Youssef Hamadi;Lintao Zhang
Affiliations:
Microsoft Research, Cambridge, UK;Microsoft Research, Cambridge, UK;Microsoft Research, La Avenida Mountain View, CA
Venue:
ACM Computing Surveys (CSUR)
Year:
2006

Citing 123
Cited 20

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Arc and path consistence revisited

Artificial Intelligence
Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Constraint propagation with interval labels

Artificial Intelligence
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition

Artificial Intelligence
An introduction to Prolog III

Communications of the ACM
On the parallel complexity of discrete relaxation in constraint satisfaction networks

Artificial Intelligence
A transitive closure based algorithm for test generation

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Partial constraint satisfaction

Artificial Intelligence - Special volume on constraint-based reasoning
Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A generic arc-consistency algorithm and its specializations

Artificial Intelligence
Tabu search

Modern heuristic techniques for combinatorial problems
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
GENET: a connectionist architecture for solving constraint satisfaction problems by iterative improvement

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Arc-consistency and arc-consistency again

Artificial Intelligence
Improvements to propositional satisfiability search algorithms

Improvements to propositional satisfiability search algorithms
PSATO: a distributed propositional prover and its application to quasigroup problems

Journal of Symbolic Computation - Special issue on parallel symbolic computation
GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Supermodels and robustness

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Hard problems for CSP Algorithms

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Combinational equivalence checking using satisfiability and recursive learning

DATE '99 Proceedings of the conference on Design, automation and test in Europe
The essence of constraint propagation

Theoretical Computer Science
A massively-parallel easily-scalable satisfiability solver using reconfigurable hardware

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
On the run-time behaviour of stochastic local search algorithms for SAT

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Backtrack Programming

Journal of the ACM (JACM)
Deciding Combinations of Theories

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
New methods to color the vertices of a graph

Communications of the ACM
Search and strategies in OPL

ACM Transactions on Computational Logic (TOCL)
Synthesizing constraint expressions

Communications of the ACM
A machine program for theorem-proving

Communications of the ACM
On the relations between SAT and CSP enumerative algorithms

Discrete Applied Mathematics - Special issue on Boolean functions and related problems
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Bounded Model Checking Using Satisfiability Solving

Formal Methods in System Design
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver

Proceedings of the 39th annual Design Automation Conference
A constraint-based architecture for local search

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

Constraints
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems

Journal of Automated Reasoning
Implementing the Davis–Putnam Method

Journal of Automated Reasoning
A Constraint Programming Framework for Local Search Methods

Journal of Heuristics
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Run-time performance optimization of an FPGA-based deduction engine for SAT solvers

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A Tutorial on Stålmarck‘s Proof Procedure for PropositionalLogic

Formal Methods in System Design - Special issue on formal methods for computer-added design
On the Efficiency of Parallel Backtracking

IEEE Transactions on Parallel and Distributed Systems
Dependent and Independent Variables in Propositional Satisfiability

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Solving Constraint Satisfaction Problems with DNA Computing

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Applications of Constraint Programming

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Optimal Distributed Arc-Consistency

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
One Flip per Clock Cycle

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Using Logic Programming for Fault Diagnosis in Digital Circuits

GWAI '87 Proceedings of the 11th German Workshop on Artificial Intelligence
Tuning SAT Checkers for Bounded Model Checking

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Deciding Separation Formulas with SAT

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Automatic verification of Pipelined Microprocessor Control

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Solving Boolean Satisfiability with Dynamic Hardware Configurations

FPL '98 Proceedings of the 8th International Workshop on Field-Programmable Logic and Applications, From FPGAs to Computing Paradigm
Solving Satisfiability Problems on FPGAs

FPL '96 Proceedings of the 6th International Workshop on Field-Programmable Logic, Smart Applications, New Paradigms and Compilers
Integrating Equivalency Reasoning into Davis-Putnam Procedure

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions

Proceedings of the 40th annual Design Automation Conference
Shatter: efficient symmetry-breaking for boolean satisfiability

Proceedings of the 40th annual Design Automation Conference
Dynamic restart policies

Eighteenth national conference on Artificial intelligence
Accelerating Boolean Satisfiability with Configurable Hardware

FCCM '98 Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines
Automatic synthesis of optimal invariant assertions: Mathematical foundations

Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Interleaved Backtracking in Distributed Constraint Networks

ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
Constraint Processing

Constraint Processing
Dynamic Programming

Dynamic Programming
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
Generating Semantic Descriptions From Drawings of Scenes With Shadows

Generating Semantic Descriptions From Drawings of Scenes With Shadows
Basic components for constraint solver cooperations

Proceedings of the 2003 ACM symposium on Applied computing
Exploiting Signal Unobservability for Efficient Translation to CNF in Formal Verification of Microprocessors

Proceedings of the conference on Design, automation and test in Europe - Volume 1
Ant Colony Optimization

Ant Colony Optimization
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints

IEEE Transactions on Computers
Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces", 27)

Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces", 27)
AMUSE: a minimally-unsatisfiable subformula extractor

Proceedings of the 41st annual Design Automation Conference
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
A Circuit SAT Solver With Signal Correlation Guided Learning

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Reconfigurable Hardware SAT Solvers: A Survey of Systems

IEEE Transactions on Computers
GridSAT: A Chaff-based Distributed SAT Solver for the Grid

Proceedings of the 2003 ACM/IEEE conference on Supercomputing
An optimal coarse-grained arc consistency algorithm

Artificial Intelligence
Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts

ICTAI '05 Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence
Constraint-Based Local Search

Constraint-Based Local Search
Automated reformulation of specifications by safe delay of constraints

Artificial Intelligence
ZetaSAT - Boolean SATisfiability solving on Desktop Grids

CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Complete local search for propositional satisfiability

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Robust solutions for constraint satisfaction and optimization

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Generalized nogoods in CSPs

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
SymChaff: a structure-aware satisfiability solver

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Interleaved depth-first search

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Depth-bounded discrepancy search

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Numerica: a modeling language for global optimization

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Domain filtering consistencies

Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability II: theory

Journal of Artificial Intelligence Research
Using inference to reduce arc consistency computation

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A fast and simple algorithm for bounds consistency of the all different constraint

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Propagating logical combinations of constraints

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The rules of constraint modelling

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Scalability study of peer-to-peer consequence finding

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Automatic abstraction without counterexamples

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
The effect of Nogood recording in DPLL-CBJ SAT algorithms

ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Russian doll search for solving constraint optimization problems

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Performance prediction and automated tuning of randomized and parametric algorithms

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
NiVER: non-increasing variable elimination resolution for preprocessing SAT instances

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A SAT-based decision procedure for mixed logical/integer linear problems

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A clause-based heuristic for SAT solvers

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Effective preprocessing in SAT through variable and clause elimination

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Optimizations for compiling declarative models into boolean formulas

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
SMT-COMP: satisfiability modulo theories competition

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
DPLL(T) with exhaustive theory propagation and its application to difference logic

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Exploration of the capabilities of constraint programming for software verification

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Algorithms for maximum satisfiability using unsatisfiable cores

Proceedings of the conference on Design, automation and test in Europe
Temporal Logic with Capacity Constraints

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Solving SQL Constraints by Incremental Translation to SAT

IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
A Study of SAT-Based Branching Heuristics for the CSP

SETN '08 Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications
Interleaved Alldifferent Constraints: CSP vs. SAT Approaches

AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Formalization and Implementation of Modern SAT Solvers

Journal of Automated Reasoning
A MAX-SAT Algorithm Portfolio

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Towards an Embedded Approach to Declarative Problem Solving in ASP

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints

MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Local consistency and SAT-solvers

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Boosting distributed constraint satisfaction

Journal of Heuristics
Weight constraint programs with evaluable functions

Annals of Mathematics and Artificial Intelligence
Domain-splitting generalized nogoods from restarts

EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
RegSTAB: a SAT solver for propositional schemata

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Improving parallel local search for SAT

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Modeling and solving AFs with a constraint-based tool: conarg

TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Analysing monitoring and switching problems for adaptive systems

Journal of Systems and Software
Argumentation frameworks as constraint satisfaction problems

Annals of Mathematics and Artificial Intelligence
Dynamic policy adaptation for inference control of queries to a propositional information system

Journal of Computer Security - DBSec 2011
Linear time-dependent constraints programming with MSVL

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two relatively independent threads of research cross-fertilizing occasionally. These two approaches to problem solving have a lot in common as evidenced by similar ideas underlying the branch and prune algorithms that are most successful at solving both kinds of problems. They also exhibit differences in the way they are used to state and solve problems since SAT's approach is, in general, a black-box approach, while CP aims at being tunable and programmable. This survey overviews the two areas in a comparative way, emphasizing the similarities and differences between the two and the points where we feel that one technology can benefit from ideas or experience acquired from the other.