Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability
- 8 June 2001
- book chapter
- Published by Springer Nature
- p. 347-363
- https://doi.org/10.1007/3-540-45744-5_26
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Ordered Binary Decision Diagrams and the Davis-Putnam procedurePublished by Springer Nature ,2005
- On the complexity of choosing the branching literal in DPLLArtificial Intelligence, 2000
- Single Step Tableaux for Modal LogicsJournal of Automated Reasoning, 2000
- Symbolic Model Checking without BDDsPublished by Springer Nature ,1999
- SATO: An efficient propositional proverLecture Notes in Computer Science, 1997
- Using CSP look-back techniques to solve exceptionally hard SAT instancesPublished by Springer Nature ,1996
- Temporal constraint networksArtificial Intelligence, 1991
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemDiscrete Applied Mathematics, 1983
- A machine program for theorem-provingCommunications of the ACM, 1962