Jussi Rintanen  Home/Search
Context Related
| informatik.unifreib...Rintanen99qbf.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unifreiburg.de/...qbf (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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)
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)
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):390 A machine program for theorem proving (context) - Davis, Logemann et al. - 1962
320 Hard and easy distributions of SAT problems - Mitchell, Selman et al. - 1992
161 Complexity results for nonmonotonic logics (context) - Gottlob - 1992
123 A linear time algorithm for testing the truth of certain qua.. (context) - Aspvall, Plass et al. - 1979
84 The complexity of logic-based abduction - Eiter, Gottlob - 1995
72 Heuristics based on unit propagation for satisfiability prob.. - Li - 1997
64 The equivalence problem for regular expressions with squarin.. (context) - Meyer, Stockmeyer - 1972
52 An algorithm to evaluate quantified Boolean formulae - Cadoli, Giovanardi et al. - 1998
48 Constructing conditional plans by a theorem-prover - Rintanen - 1999
31 Beyond NP: the QSAT phase transition - Gent, Walsh - 1998
19 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