QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers

Authors:
Abdelwaheb Ayari;David A. Basin
Affiliations:
-;-
Venue:
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Year:
2002

Citing 17
Cited 19

An optimality result for clause form translation

Journal of Symbolic Computation
An algorithm to evaluate quantified Boolean formulae

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Checking equivalence for partial implementations

Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Improvements to the Evaluation of Quantified Boolean Formulae

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Bounded Model Construction for Monadic Second-Order Logics

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Tuning SAT Checkers for Bounded Model Checking

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
On Generating Small Clause Normal Forms

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Structural and Behavioral Modeling with Monadic Logics

ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
A satisfiability procedure for quantified boolean formulae

Discrete Applied Mathematics - The renesse issue on satisfiability
Constructing conditional plans by a theorem-prover

Journal of Artificial Intelligence Research
Backjumping for quantified Boolean logic satisfiability

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Computational methods for database repair by signed formulae*

Annals of Mathematics and Artificial Intelligence
Variable Dependencies of Quantified CSPs

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A solver for QBFs in negation normal form

Constraints
Backdoor Sets of Quantified Boolean Formulas

Journal of Automated Reasoning
A Unified Framework for Certificate and Compilation for QBF

ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
A Solver for QBFs in Nonprenex Form

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A Compact Representation for Syntactic Dependencies in QBFs

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers

Electronic Notes in Theoretical Computer Science (ENTCS)
Bounded universal expansion for preprocessing QBF

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Nenofex: expanding NNF for QBF solving

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
An AIG-Based QBF-solver using SAT for preprocessing

Proceedings of the 47th Design Automation Conference
Resolve and expand

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Representing paraconsistent reasoning via quantified propositional logic

Inconsistency Tolerance
Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Integrating dependency schemes in search-based QBF solvers

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Dependency quantified horn formulas: models and complexity

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Computing resolution-path dependencies in linear time ,

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Solving QBF with counterexample guided refinement

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
On propositional QBF expansions and q-resolution

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe Qubos (QUantified BOolean Solver), a decision procedure for quantified Boolean logic. The procedure is based on nonclausal simplification techniques that reduce formulae to a propositional clausal form after which off-the-shelf satisfiability solvers can be employed. W e show that there are domains exhibiting structure for which this procedure is very effective and we report on experimental results.