Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 386-392
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Resolve and Expand2005
- The Second QBF Solvers Comparative EvaluationLecture Notes in Computer Science, 2005
- Equivalence Models for Quantified Boolean FormulasLecture Notes in Computer Science, 2005
- On Boolean Models for Quantified Boolean Horn FormulasLecture Notes in Computer Science, 2004
- Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas2002
- Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean FormulaeLecture Notes in Computer Science, 2001
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979