A Branching Heuristics for Quantified Renamable Horn Formulas
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 393-399
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Optimizing a BDD-Based Modal SolverLecture Notes in Computer Science, 2003
- Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed SystemsLecture Notes in Computer Science, 2002
- Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation2002
- Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas2002
- BDD-Based Decision Procedures for $ \mathcal{K} $Lecture Notes in Computer Science, 2002
- Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean FormulaeLecture 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
- A linear algorithm for renaming a set of clauses as a Horn setTheoretical Computer Science, 1994
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979