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)
Experimental results on the application of satisfiability algorithms to scheduling problems
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A machine program for theorem-proving
Communications of the ACM
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A non-deterministic semantics for tractable inference
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
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
The constrainedness knife-edge
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
Inferring state constraints for domain-independent planning
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
Algorithms for solving Boolean satisfiability in combinational circuits
DATE '99 Proceedings of the conference on Design, automation and test in Europe
Contingent planning under uncertainty via stochastic satisfiability
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
Boolean satisfiability in electronic design automation
Proceedings of the 37th Annual Design Automation Conference
Alcoa: the alloy constraint analyzer
Proceedings of the 22nd international conference on Software engineering
On applying incremental satisfiability to delay fault testing
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Automating first-order relational logic
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Satisfiability models and algorithms for circuit delay computation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Local search characteristics of incomplete SAT procedures
Artificial Intelligence
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Satometer:: how much have we searched?
Proceedings of the 39th annual Design Automation Conference
Encoding domain knowledge for prositional planning
Logic-based artificial intelligence
SAT and ATPG: algorithms for Boolean decision problems
Logic Synthesis and Verification
An Overview of Backtrack Search Satisfiability Algorithms
Annals of Mathematics and Artificial Intelligence
Parallel cooperative propositional theorem proving
Annals of Mathematics and Artificial Intelligence
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Proving Consistency Assertions for Automotive Product Data Management
Journal of Automated Reasoning
Logical Cryptanalysis as a SAT Problem
Journal of Automated Reasoning
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Nonsystematic Search and No-Good Learning
Journal of Automated Reasoning
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Phase Transitions in Relational Learning
Machine Learning
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Complexity results for structure-based causality
Artificial Intelligence
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Towards Provably Complete Stochastic Search Algorithms for Satisfiability
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Fages' Theorem for Programs with Nested Expressions
Proceedings of the 17th International Conference on Logic Programming
Modelling More Realistic SAT Problems
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains
IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Non-systematic Search and Learning: An Empirical Study
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A Hybrid Seachr Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Maintaining Arc-Consistency within Dynamic Backtracking
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Formal Models of Heavy-Tailed Behavior in Combinatorial Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Capturing Structure with Satisfiability
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Wire Routing and Satisfiability Planning
CL '00 Proceedings of the First International Conference on Computational Logic
CL '00 Proceedings of the First International Conference on Computational Logic
Systematic vs. Local Search for SAT
KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Propositional Satisfiability in Answer-Set Programming
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Benefits of Bounded Model Checking at an Industrial Setting
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Conditional Pure Literal Graphs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A logic programming approach to knowledge-state planning, II: the DLVk system
Artificial Intelligence
Journal of Symbolic Computation
Conflict driven learning in a quantified Boolean Satisfiability solver
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
SAT and ATPG: Boolean engines for formal hardware verification
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Enhancing Davis Putnam with extended binary clause reasoning
Eighteenth national conference on Artificial intelligence
Inference methods for a pseudo-boolean satisfiability solver
Eighteenth national conference on Artificial intelligence
Learning for quantified boolean logic satisfiability
Eighteenth national conference on Artificial intelligence
Backjumping for quantified Boolean logic satisfiability
Artificial Intelligence
A complete adaptive algorithm for propositional satisfiability
Discrete Applied Mathematics
On the Fine Structure of Large Search Spaces
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Search Strategies for Hybrid Search Spaces
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Contingent planning under uncertainty via stochastic satisfiability
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Random 3-SAT: The Plot Thickens
Constraints
Solving Satisfiability in Combinational Circuits
IEEE Design & Test
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
Equivalent literal propagation in the DLL procedure
Discrete Applied Mathematics - The renesse issue on satisfiability
SAT problems with chains of dependent variables
Discrete Applied Mathematics - The renesse issue on satisfiability
Formal methods for the validation of automotive product configuration data
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Satisfiability-Based Algorithms for Boolean Optimization
Annals of Mathematics and Artificial Intelligence
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination
Annals of Mathematics and Artificial Intelligence
Combining linear programming and satisfiability solving for resource planning
The Knowledge Engineering Review
A logic programming approach to knowledge-state planning: Semantics and complexity
ACM Transactions on Computational Logic (TOCL)
Learning in a compiler for MINSAT algorithms
Theory and Practice of Logic Programming
A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints
IEEE Transactions on Computers
Software assurance by bounded exhaustive testing
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Satisfiability and integer programming as complementary tools
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Local Search for Boolean Relations on the Basis of Unit Propagation
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Verification of Proofs of Unsatisfiability for CNF Formulas
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
A software/reconfigurable hardware SAT solver
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Annals of Mathematics and Artificial Intelligence
Efficient Data Structures for Backtrack Search SAT Solvers
Annals of Mathematics and Artificial Intelligence
Toward Leaner Binary-Clause Reasoning in a Satisfiability Solver
Annals of Mathematics and Artificial Intelligence
An Effective Algorithm for the Futile Questioning Problem
Journal of Automated Reasoning
Software Assurance by Bounded Exhaustive Testing
IEEE Transactions on Software Engineering
Processes and continuous change in a SAT-based planner
Artificial Intelligence
Functional test generation based on word-level SAT
Journal of Systems Architecture: the EUROMICRO Journal
Predicate-calculus-based logics for modeling and solving search problems
ACM Transactions on Computational Logic (TOCL)
The distributed breakout algorithms
Artificial Intelligence - Special issue: Distributed constraint satisfaction
NP-completeness for all computer science undergraduates: a novel project-based curriculum
Journal of Computing Sciences in Colleges
Efficient Symmetry Breaking for Boolean Satisfiability
IEEE Transactions on Computers
A backjumping technique for disjunctive logic programming
AI Communications
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
Journal of Automated Reasoning
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
Journal of Automated Reasoning
Local search for quantified Boolean formulas
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Efficient theory combination via boolean search
Information and Computation - Special issue: Combining logical systems
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
AND/OR search spaces for graphical models
Artificial Intelligence
Evolving combinatorial problem instances that are difficult to solve
Evolutionary Computation
Bounded Model Checking with Parametric Data Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Sequential Circuits for Relational Analysis
ICSE '07 Proceedings of the 29th international conference on Software Engineering
Discrete Applied Mathematics
BerkMin: A fast and robust Sat-solver
Discrete Applied Mathematics
Random backtracking in backtrack search algorithms for satisfiability
Discrete Applied Mathematics
Regular-SAT: A many-valued approach to solving combinatorial problems
Discrete Applied Mathematics
On-the-fly resolve trace minimization
Proceedings of the 44th annual Design Automation Conference
Using SAT-based techniques in power estimation
Microelectronics Journal
Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
Annals of Mathematics and Artificial Intelligence
Solution and Optimization of Systems of Pseudo-Boolean Constraints
IEEE Transactions on Computers
Sequential circuits for program analysis
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Another look at graph coloring via propositional satisfiability
Discrete Applied Mathematics
Efficient Generation of Unsatisfiability Proofs and Cores in SAT
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Boolean satisfiability from theoretical hardness to practical success
Communications of the ACM - A Blind Person's Interaction with Technology
Formalization and Implementation of Modern SAT Solvers
Journal of Automated Reasoning
Verification Techniques for System-Level Design
Verification Techniques for System-Level Design
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Return of the JTMS: Preferences Orchestrate Conflict Learning and Solution Synthesis
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Early Identification of Problem Interactions: A Tool-Supported Approach
REFSQ '09 Proceedings of the 15th International Working Conference on Requirements Engineering: Foundation for Software Quality
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
An Exponential Lower Bound for Width-Restricted Clause Learning
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Problem-Sensitive Restart Heuristics for the DPLL Procedure
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
The backdoor key: a path to understanding problem hardness
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
Performing Bayesian inference by weighted model counting
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Clause learning can effectively P-simulate general propositional resolution
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Efficient memoization for dynamic programming with ad-hoc constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
On reachability, relevance, and resolution in the planning as satisfiability approach
Journal of Artificial Intelligence Research
Conflict-directed backjumping revisited
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability II: theory
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability III: implementation
Journal of Artificial Intelligence Research
Clause/term resolution and learning in the evaluation of quantified Boolean formulas
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Using Walk-SAT and Rel-SAT for cryptographic key search
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
The LPSAT engine & its application to resource planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Reachability, relevance, resolution and the planning as satisfiability approach
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Improving Graphplan's search with EBL & DDB techniques
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Nogood recording from restarts
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Understanding the power of clause learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Compiling uncertainty away in conformant planning problems with bounded width
Journal of Artificial Intelligence Research
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Backjumping for quantified Boolean logic satisfiability
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A simplifier for propositional formulas with many binary clauses
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Processes and continuous change in a SAT-based planner
Artificial Intelligence
The distributed breakout algorithms
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Reasoning from last conflict(s) in constraint programming
Artificial Intelligence
Towards a Small Model Theorem for Data Independent Systems in Alloy
Electronic Notes in Theoretical Computer Science (ENTCS)
Adaptive Application of SAT Solving Techniques
Electronic Notes in Theoretical Computer Science (ENTCS)
Improving GASAT by replacing tabu search by DLM and enhancing the best members
Artificial Intelligence Review
Practical algorithms for unsatisfiability proof and core generation in SAT solvers
AI Communications - Practical Aspects of Automated Reasoning
Conflict-driven answer set enumeration
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
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
A lightweight component caching scheme for satisfiability solvers
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Towards robust CNF encodings of cardinality constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
On universal restart strategies for backtracking search
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Clone: solving weighted Max-SAT in a reduced search space
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
An interpolation method for CLP traversal
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
On the power of clause-learning SAT solvers with restarts
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Solving satisfiability in combinational circuits with backtrack search and recursive learning
SBCCI'99 Proceedings of the XIIth conference on Integrated circuits and systems design
Information theory and security: quantitative information flow
SFM'10 Proceedings of the Formal methods for quantitative aspects of programming languages, and 10th international conference on School on formal methods for the design of computer, communication and software systems
On the power of clause-learning SAT solvers as resolution engines
Artificial Intelligence
Relieving capacity limits on FPGA-based SAT-solvers
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Clause-learning algorithms with many restarts and bounded-width resolution
Journal of Artificial Intelligence Research
On freezing and reactivating learnt clauses
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
A bayesian approach to tackling hard computational problems
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Evaluating search strategies and heuristics for efficient answer set programming
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Pool resolution and its relation to regular resolution and DPLL with clause learning
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A SAT-based decision procedure for the boolean combination of difference constraints
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
QBF reasoning on real-world instances
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Zchaff2004: an efficient SAT solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Applied quantitative information flow and statistical databases
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
A clause-based heuristic for SAT solvers
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
An incremental and layered procedure for the satisfiability of linear arithmetic logic
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Lower bounds for width-restricted clause learning on small width formulas
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Monotonicity analysis can speed up verification
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Building efficient decision procedures on top of SAT solvers
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Lower bounds for width-restricted clause learning on formulas of small width
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Conflict analysis in mixed integer programming
Discrete Optimization
Understanding script-based stories using commonsense reasoning
Cognitive Systems Research
An overview of parallel SAT solving
Constraints
An empirical study of learning and forgetting constraints
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Look-back Techniques for ASP Programs with Aggregates
Fundamenta Informaticae
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Online speedup learning for optimal planning
Journal of Artificial Intelligence Research
Planning as satisfiability: Heuristics
Artificial Intelligence
Correctness of solving query-answering problems using satisfiability solvers
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part I
Some trade-off results for polynomial calculus: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Exponential separations in a hierarchy of clause learning proof systems
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Towards an understanding of polynomial calculus: new separations and lower bounds
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Implicit learning of common sense for reasoning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.01 |
We report on the performance of an enhanced version of the "Davis-Putnam" (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from real-world problems in planning, scheduling, and circuit diagnosis and synthesis. Our results show that incorporating CSP look-back techniques -- especially the relatively new technique of relevance-bounded learning -- renders easy many problems which otherwise are beyond DP's reach. Frequently they make DP, a systematic algorithm, perform as well or better than stochastic SAT algorithms such as GSAT or WSAT. We recommend that such techniques be included as options in implementations of DP, Just as they are in systematic algorithms for the more general constraint satisfaction problem.