(Enter summary)
Abstract: We present a theorem-prover for quantified
Boolean formulae and evaluate it on random
quantified formulae and formulae that represent
problems from automated planning. Even
though the notion of quantified Boolean formula
is theoretically important, automated reasoning
with QBF has not been thoroughly investigated.
Universal quantifiers are needed
in representing many computational problems
that cannot be easily translated to the propositional
logic and solved by satisfiability... (Update)
Cited by: More
On Computing Belief Change Operations using - Quantified Boolean Formulas
(Correct)
Boolean Quantification - In First-Order Context
(Correct)
A Polynomial Translation of Logic Programs with Nested.. - David Pearce Vladimir (2002)
(Correct)
Active bibliography (related documents): More All
0.5: Sharply Bounded Alternation and Quasilinear Time - Bloch, Buss, Goldsmith (1997)
(Correct)
0.2: Maximization Versions of "Lights Out" Games in Grids and Graphs - John Goldwasser And
(Correct)
0.2: The Complexity of the Covering Radius Problem on.. - Guruswami, Micciancio..
(Correct)
Similar documents based on text: More All
0.4: Reconfigurable Interconnect Synthesis via.. - Siva, Vemuri.. (2002)
(Correct)
0.3: Solving 2-CNF Quantified Boolean Formulae using Variable.. - Gent, Rowley (2002)
(Correct)
0.2: Partial implicit unfolding in the Davis-Putnam procedure for.. - Rintanen (2001)
(Correct)
Related documents from co-citation: More All
28: An algorithm to evaluate quantified Boolean formulae
- Cadoli, Giovanardi et al. - 1998
14: A distributed algorithm to evaluate quantified boolean formulae
- Feldmann, Monien et al. - 2000
11: Constructing conditional plans by a theorem prover
- Rintanen - 1999
BibTeX entry: (Update)
Rintanen, J. (1999). Improvements to the evaluation of quantified Boolean formulae. In Proceedings of the 16th International Joint Conference on Artificial Intelligence. Morgan Kaufmann Publishers. to appear. http://citeseer.ist.psu.edu/rintanen99improvements.html More
@inproceedings{ rintanen99improvements,
author = "Jussi Rintanen",
title = "Improvements to the Evaluation of Quantified Boolean Formulae",
booktitle = "{IJCAI}",
pages = "1192-1197",
year = "1999",
url = "citeseer.ist.psu.edu/rintanen99improvements.html" }
Citations (may not include all citations):
381
A machine program for theorem proving (context) - Davis, Logemann et al. - 1962
311
Hard and easy distributions of SAT problems
- Mitchell, Selman et al. - 1992
158
Complexity results for nonmonotonic logics (context) - Gottlob - 1992
120
A linear time algorithm for testing the truth of certain qua.. (context) - Aspvall, Plass et al. - 1979
78
The complexity of logic-based abduction
- Eiter, Gottlob - 1995
66
Heuristics based on unit propagation for satisfiability prob..
- Li - 1997
64
The equivalence problem for regular expressions with squarin.. (context) - Meyer, Stockmeyer - 1972
50
An algorithm to evaluate quantified Boolean formulae
- Cadoli, Giovanardi et al. - 1998
47
Constructing conditional plans by a theorem-prover
- Rintanen - 1999
28
Beyond NP: the QSAT phase transition
- Gent, Walsh - 1998
17
Resolution for quantified Boolean formulas (context) - Buning, Karpinski et al. - 1995
4
Complexity of computing the covering radius of a code (context) - McLoughlin - 1984
2
Deciding the Vapnik- Cervonenkis dimension is \Sigma P 3 -co.. (context) - Schafer - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-freiburg.de/~rintanen/qbf.html):
Constructing Conditional Plans by a Theorem-Prover - Rintanen (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC