Solving Non-clausal Formulas with DPLL Search
- 1 January 2004
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Using Problem Structure for Efficient Clause LearningLecture Notes in Computer Science, 2004
- Dependent and Independent Variables in Propositional SatisfiabilityLecture Notes in Computer Science, 2002
- Recovering and Exploiting Structural Knowledge from CNF FormulasLecture Notes in Computer Science, 2002
- Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solverPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- ChaffPublished by Association for Computing Machinery (ACM) ,2001
- Towards an Efficient Tableau Method for Boolean Circuit Satisfiability CheckingLecture Notes in Computer Science, 2000
- Applying the Davis-Putnam procedure to non-clausal formulasLecture Notes in Computer Science, 2000
- Satisfiability testing with more reasoning and less guessingPublished by American Mathematical Society (AMS) ,1996
- A Structure-preserving Clause Form TranslationJournal of Symbolic Computation, 1986
- A machine program for theorem-provingCommunications of the ACM, 1962