Bounded Universal Expansion for Preprocessing QBF
Authors:
- 28 June 2007
- book chapter
- Published by Springer Nature
- p. 244-257
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Report of the Third QBF Solvers Evaluation1Journal on Satisfiability, Boolean Modeling and Computation, 2006
- Using SAT in QBF2005
- Association Rule Mining2002
- An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental EvaluationJournal of Automated Reasoning, 2002
- Constructing Conditional Plans by a Theorem-ProverJournal of Artificial Intelligence Research, 1999
- Resolution for Quantified Boolean FormulasInformation and Computation, 1995
- The equivalence problem for regular expressions with squaring requires exponential space1972
- A machine program for theorem-provingCommunications of the ACM, 1962