E. Giunchiglia, M. Narizzano, A. Tacchella  Home/Search
Context Related
| rice.edu/~tac/Publica...wsijcar01.ps.gz 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: rice.edu/~tac/publist (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Trivial truth and backjumping are two optimization techniques that have been proposed for deciding quantified boolean formulas (QBFs) satisfiability. Both these techniques can greatly improve the overall performance of a QBF solver, but they are the expression of opposite philosophies. On one hand, trivial truth is a "look-ahead" policy: it is applied when descending the search tree to (try to) prune it. On the other hand, backjumping is a "look-back" policy: it is applied when... (Update)
Similar documents based on text: More All
1.0: Assessing the impact of Learning Techniques in.. - Giunchiglia.. (2002) (Correct)
0.5: Backjumping for Quantified Boolean Logic Satisfiability - Giunchiglia, Narizzano.. (2001) (Correct)
0.5: On Quantifier Shifting for Quantified Boolean Formulas - Egly, Tompits, Woltran (2002) (Correct)
BibTeX entry: (Update)
Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. On the effectiveness of backjumping and trivial truth in quantified boolean formulas satisfiability, 2001. Submitted. Available at www.mrg.dist.unige.it/star/qube. http://citeseer.ist.psu.edu/giunchiglia01effectiveness.html More
@misc{ giunchiglia01effectiveness,
author = "E. Giunchiglia and M. Narizzano and A. Tacchella",
title = "the effectiveness of backjumping and trivial truth in quantified boolean
formulas satisfiability",
text = "Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. On the effectiveness
of backjumping and trivial truth in quantified boolean formulas satisfiability,
2001. Submitted. Available at www.mrg.dist.unige.it/star/qube.",
year = "2001",
url = "citeseer.ist.psu.edu/giunchiglia01effectiveness.html" }
Citations (may not include all citations):211 Hybrid algorithms for the constraint satisfaction problem (context) - Prosser - 1993
190 Using CSP Look-Back Techniques to Solve Real-World SAT insta.. - Bayardo, Schrag - 1997
94 A Structure-preserving Clause Form Translation (context) - Plaisted, Greenbaum - 1986
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.
51 Report on a SAT competition - Buro, Kleine-Buning - 1992
35 Introduction to the Practice of Statistics (context) - Moore, McCabe - 1993
35 Improvements to the Evaluation of Quantified Boolean Formula.. - Rintanen - 1999
31 Beyond NP: the QSAT phase transition - Gent, Walsh - 1999
20 A Distributed Algorithm to Evaluate Quantified Boolean Formu.. - Feldmann, Monien et al. - 2000
19 Resolution for quantified boolean formulas (context) - Kleine-Buning, Karpinski et al. - 1995
12 QuBE: a system for Deciding Quantified Boolean Formulas Sati.. - Giunchiglia, Narizzano et al. - 2001
8 Backjumping for Quantified Boolean Logic Satisfiability - Giunchiglia, Narizzano et al. - 2001
8 Evaluating search heuristics and optimization techniques in .. - Giunchiglia, Maratea et al. - 2001
5 Design and Results of TANCS (context) - Massacci, Donini
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.rice.edu/~tac/publist.html): More
Evaluating Search Heuristics and Optimization.. - Giunchiglia.. (2001) (Correct)
SAT-Based Decision Procedures for Classical Modal Logics - Giunchiglia, Giunchiglia, .. (2000) (Correct)
Testing for Satisfiability in Modal Logics using a.. - Giunchiglia, Tacchella (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