Marco Cadoli, Massimo Giovanardi, Marco Schaerf  Home/Search
Context
Related
| i2.com/workshops/aaai20...MSchaerf00.ps Cached: 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.
PS.gz PS Image Update HelpFrom: i2.com/workshops/aaai200...aaaior (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Theoretical analysis has shown that advanced forms of reasoning have computational complexity higher than NP, e.g., they are either PSPACE-complete or complete for some level of the Polynomial Hierarchy. Although some PSPACE- and \Sigma p 2 -complete reasoning problems have been analyzed from an experimental point of view, we believe that there are still some important open questions regarding experiments on such complexity classes. We focus on evaluation of Quantified Boolean... (Update)
Similar documents (at the sentence level):
15.9%: An Algorithm to Evaluate Quantified Boolean.. - Cadoli, Schaerf.. (1999) (Correct)
7.1%: An Algorithm to Evaluate Quantified Boolean Formulae - Cadoli, Giovanardi, Schaerf (1998) (Correct)
5.9%: Experimental Analysis of the Computational Cost of Evaluating.. - Marco Cadoli (1997) (Correct)
Active bibliography (related documents): More All
0.1: An Analysis of Empirical Testing for Modal Decision.. - Horrocks.. (2000) (Correct)
0.1: Stochastic Boolean Satisfiability - Littman, Majercik, Pitassi (2000) (Correct)
0.1: On the Effectiveness of Backjumping and Trivial.. - Giunchiglia.. (2001) (Correct)
Similar documents based on text: More All
0.5: On Quantifier Shifting for Quantified Boolean Formulas - Egly, Tompits, Woltran (2002) (Correct)
0.5: Solving Advanced Reasoning Tasks using Quantified.. - Egly, Eiter, Tompits.. (2000) (Correct)
0.4: Algorithms for Quantified Boolean Formulas - Williams (2002) (Correct)
BibTeX entry: (Update)
@misc{ cadoli-evaluation,
author = "Marco Cadoli and Massimo Giovanardi and Marco Schaerf",
title = "Evaluation of Quantified Boolean Formulae on ... and PSPACE-complete instances",
url = "citeseer.ist.psu.edu/cadoli00evaluation.html" }
Citations (may not include all citations):147 The computational complexity of propositional STRIPS plannin.. - Bylander - 1994
105 Word problems requiring exponential time (context) - Stockmeyer, Meyer - 1973
92 Building decision procedures for modal logics from propositi.. - Giunchiglia, Sebastiani - 1996
84 The complexity of logic-based abduction - Eiter, Gottlob - 1995
84 The KR system dlv: Progress report (context) - Eiter, Leone et al. - 1998
69 The polynomial-time hierarchy (context) - Stockmeyer - 1976
52 An algorithm to evaluate quantified boolean formulae - Cadoli, Giovanardi et al. - 1998
52 An algorithm to evaluate quantified boolean formulae and its.. - Cadoli, Schaerf et al. - 1999
31 Beyond NP: the QSAT phase transition - Gent, Walsh - 1999
25 The effect of bounding the number of primitive propositions .. - Halpern - 1995
23 Experimental results on the crossover point in random 3-SAT (context) - Crawford, Auton - 1996
17 Plan modification versus plan generation: a complexity-theor.. - Nebel, Koehler - 1993
1 La Sapienza (context) - DIS, Dip et al.
1 Generating Hard Satisfiability Problems (context) - Satisfiability, http et al. - 1996
Documents on the same site (http://www.i2.com/workshops/aaai2000/aaaior.html): More
On the Use of LP Relaxations in Solving SAT Encodings of.. - Do, Kambhampati (2000) (Correct)
Integrating AI Planning and Integer Programming for Use in.. - Nau, al. (2000) (Correct)
Conditions for Non-Chronological Backtracking in Boolean.. - Manquinho, Marques-Silva (2000) (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