Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
Author:
- 20 November 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 362-376
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas2002
- An Analysis of Backjumping and Trivial Truth in Quantified Boolean Formulas SatisfiabilityLecture Notes in Computer Science, 2001
- Constructing Conditional Plans by a Theorem-ProverJournal of Artificial Intelligence Research, 1999
- Resolution for Quantified Boolean FormulasInformation and Computation, 1995
- The computational complexity of propositional STRIPS planningArtificial Intelligence, 1994
- HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 1993
- The complexity of graph problems for succinctly represented graphs1990
- A note on succinct representations of graphsInformation and Control, 1986
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- A machine program for theorem-provingCommunications of the ACM, 1962