Abstract branching for quantified formulas

Authors:
Marco Benedetti
Affiliations:
LIFO, Université d'Orléans, France
Venue:
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Year:
2006

Citing 11
Cited 2

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
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
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
SATO: An Efficient Propositional Prover

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

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Conflict driven learning in a quantified Boolean Satisfiability solver

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Learning for quantified boolean logic satisfiability

Eighteenth national conference on Artificial intelligence
An Effective Algorithm for the Futile Questioning Problem

Journal of Automated Reasoning
The achilles' heel of QBF

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Constructing conditional plans by a theorem-prover

Journal of Artificial Intelligence Research
Resolve and expand

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

QCSP made practical by virtue of restricted quantification

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
An overview of AI research in Italy

Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a novel search-based decision procedure for Quantified Boolean Formulas (QBFs), called Abstract Branching. As opposed to standard search-based procedures, it escapes the burdensome need for branching on both children of every universal node in the search tree. This is achieved by branching on existential variables only, while admissible universal assignments are inferred. Running examples and experimental results are reported.