Boolean Propagation Based on Literals for Quantified Boolean Formulae

Authors:
Igor Stéphan
Affiliations:
LERIA, Université d'Angers, France, email: igor.stephan@info.univangers.fr
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 15
Cited 2

Resolution for quantified Boolean formulas

Information and Computation
The essence of constraint propagation

Theoretical Computer Science
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation

Journal of Automated Reasoning
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A Tutorial on Stålmarcks's Proof Procedure for Propositional Logic

FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Improvements to the Evaluation of Quantified Boolean Formulae

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Backjumping for quantified Boolean logic satisfiability

Artificial Intelligence
A satisfiability procedure for quantified boolean formulae

Discrete Applied Mathematics - The renesse issue on satisfiability
Constraint programming viewed as rule-based programming

Theory and Practice of Logic Programming
Extracting certificates from quantified boolean formulas

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Quantifier trees for QBFs

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing

A self-adaptive multi-engine solver for quantified Boolean formulas

Constraints
Beyond CNF: A Circuit-Based QBF Solver

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new set of propagation rules for quantified Boolean formulae based on literals and generated automatically thanks to quantified Boolean formulae certificates. Different decompositions by introduction of existentially quantified variables are discussed in order to construct complete systems. This set of rules is compared with already proposed quantified Boolean propagation rule sets and Stålmarck's method.