Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Specifying Latin square problems in propositional logic
Automated reasoning and its applications
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
On Anytime Coherence-Based Reasoning
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Parallel Execution of Stochastic Search Procedures on Reduced SAT Instances
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Logic for Approximate First-Order Reasoning
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
The eXtended Least Number Heuristic
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Contingent planning under uncertainty via stochastic satisfiability
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
A logical toolbox for knowledge approximation
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Specifying and solving Boolean constraint problems in relational databases: a case study
Proceedings of the 44th annual Southeast regional conference
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
Computer Search for Large Sets of Idempotent Quasigroups
Computer Mathematics
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Artificial Intelligence
Data structures for generalised arc consistency for extensional constraints
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Computing observation vectors for max-fault min-cardinality diagnoses
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Generalizing Boolean satisfiability I: background and survey of existing work
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
Balance and filtering in structured satisfiable problems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A stochastic non-CNF SAT solver
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Verification in ACL2 of a generic framework to synthesize SAT-provers
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Branching rules for satisfiability analysed with factor analysis
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
On theorem proving for program checking: historical perspective and recent developments
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
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
Self-configuration of network devices with configuration logic
AN'06 Proceedings of the First IFIP TC6 international conference on Autonomic Networking
Simplification Rules for Intuitionistic Propositional Tableaux
ACM Transactions on Computational Logic (TOCL)
A complete random jump strategy with guiding paths
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
MACE4 and SEM: a comparison of finite model generators
Automated Reasoning and Mathematics
Optimal implementation of watched literals and more general techniques
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
The method proposed by Davis, Putnam, Logemann, and Loveland for propositional reasoning, often referred to as the Davis–Putnam method, is one of the major practical methods for the satisfiability (SAT) problem of propositional logic. We show how to implement the Davis–Putnam method efficiently using the trie data structure for propositional clauses. A new technique of indexing only the first and last literals of clauses yields a unit propagation procedure whose complexity is sublinear to the number of occurrences of the variable in the input. We also show that the Davis–Putnam method can work better when unit subsumption is not used. We illustrate the performance of our programs on some quasigroup problems. The efficiency of our programs has enabled us to solve some open quasigroup problems.