Dependency Quantified Horn Formulas: Models and Complexity
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 198-211
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Quantifier structure in search based procedures for QBFs2006
- Resolve and Expand2005
- A Branching Heuristics for Quantified Renamable Horn Formulas2005
- Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas2005
- Quantifier Trees for QBFsLecture Notes in Computer Science, 2005
- On Boolean Models for Quantified Boolean Horn FormulasLecture Notes in Computer Science, 2004
- Comparing Different Prenexing Strategies for Quantified Boolean FormulasLecture Notes in Computer Science, 2004
- Qubos: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers2002
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- On sentences which are true of direct unions of algebrasThe Journal of Symbolic Logic, 1951