## QUBE: A system for deciding quantified boolean formulas satisfiability (2001)

### Cached

### Download Links

- [www.mrg.dist.unige.it]
- [www.mrg.dist.unige.it]
- [www.csie.ntu.edu.tw]
- DBLP

### Other Repositories/Bibliography

Citations: | 65 - 3 self |

### BibTeX

@INPROCEEDINGS{Giunchiglia01qube:a,

author = {Enrico Giunchiglia and Massimo Narizzano and Armando Tacchella},

title = {QUBE: A system for deciding quantified boolean formulas satisfiability},

booktitle = {},

year = {2001},

pages = {364--369},

publisher = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

178 |
A structure-preserving clause form translation
- Plaisted, Greenbaum
- 1986
(Show Context)
Citation Context ...ositional satisfiability (SAT). Notice that we allow only for propositional formulas in conjunctive normal form (CNF) as matrices of QBFs. Indeed, by applying standard CNF transformations (see, e.g., =-=[3]-=-) it is always possible to rewrite a QBF into an equisatisfiable one satisfying our restrictions. 3 QUBE algorithm QUBE is implemented in C on top of SIM, an efficient SAT decider developed by our gro... |

140 | Constructing conditional plans by a theorem prover
- RINTANEN
(Show Context)
Citation Context ...145 Genova -- Italy 1 Introduction Deciding the satisfiability of a Quantified Boolean Formula (QBF) is an important research issue in Artificial Intelligence. Many reasoning tasks involving planning =-=[1]-=-, abduction, reasoning about knowledge, non monotonic reasoning [2], can be directly mapped into the problem of deciding the satisfiability of a QBF. In this paper we present QUBE, a system for decidi... |

138 | An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
- Cadoli, Schaerf, et al.
(Show Context)
Citation Context ...tions following the branch on an universal variable have been performed, QUBE checks whether the formula obtained from ' by deleting universal literals is satisfiable. If it is, then ' is satisfiable =-=[4]. Thi-=-s optimization can produce dramatic speed-ups, particularly on randomly generated QBFs (see, e.g. [4]). The option -tt disables this check. Notice that ours is an optimized version of "trivial tr... |

113 |
Solving propositional satisfiability problems
- Jeroslow, Wang
- 1990
(Show Context)
Citation Context ...bining these options, six different branching heuristics are possible. The b ohm and jw2 heuristics are, respectively, a generalization of Bohm's heuristic [8] and "two-sided Jeroslow-Wang" =-=heuristic [9]-=- for SAT. The idea behind b ohm and jw2 is to choose literals that occur as often as possible in the shortest clauses of '. The hope is that by assigning such literals, we will have the largest amount... |

76 |
Resolution for quantified boolean formulas
- Büning, Karpinski, et al.
- 1995
(Show Context)
Citation Context ...ed by QUBE. Whenever QUBE exceedssseconds of CPU time (resp.smegs of RAM), its execution is halted. 5 QUBE performances To evaluate QUBE performances, we compare it with DECIDE [5], EVALUATE [4], QKN =-=[11]-=-, and QSOLVE [6]. According to our preliminary experimental results, the optionss-heuristics bohm-length exists give good performances on all the problems, and are thus the default. The tests run on a... |

73 | Improvements to the evaluation of quantified Boolean formulae
- Rintanen
- 1999
(Show Context)
Citation Context ...unit heuristics. The behavior of these heuristics depends on the notion of "length" of a clause. QUBE features two definitions of length of a clause C: the number of literals in C (-length a=-=ll) as in [4, 5]-=-, and the number of existential literals in C (-length exists) as in [6]. By combining these options, six different branching heuristics are possible. The b ohm and jw2 heuristics are, respectively, a... |

73 | Learning for quantified Boolean logic satisfiability
- Giunchiglia, Narizzano, et al.
- 2002
(Show Context)
Citation Context ...QUBE ver. 1.0 features backjumping, trivial truth, six different branching heuristics, i.e., implementations of ChooseLiteral, and other control options. The backjumping procedure implemented in QUBE =-=[7]-=- is a generalization of the conflict-direct backjumping procedure as implemented in SAT solvers. As far as we know, QUBE is the only QBF solver with backjumping. Because of the potential overhead, bac... |

67 | Solving advanced reasoning tasks using quantified Boolean formulas
- Egly, Eiter, et al.
- 2000
(Show Context)
Citation Context ... Quantified Boolean Formula (QBF) is an important research issue in Artificial Intelligence. Many reasoning tasks involving planning [1], abduction, reasoning about knowledge, non monotonic reasoning =-=[2]-=-, can be directly mapped into the problem of deciding the satisfiability of a QBF. In this paper we present QUBE, a system for deciding QBFs satisfiability. We start our presentation in x 2 with some ... |

53 | A distributed algorithm to evaluate quantified boolean formulae
- Feldmann, Monien, et al.
- 2000
(Show Context)
Citation Context ..."length" of a clause. QUBE features two definitions of length of a clause C: the number of literals in C (-length all) as in [4, 5], and the number of existential literals in C (-length exis=-=ts) as in [6]. By combi-=-ning these options, six different branching heuristics are possible. The b ohm and jw2 heuristics are, respectively, a generalization of Bohm's heuristic [8] and "two-sided Jeroslow-Wang" he... |

52 |
based on unit propagation for satisfiability problems
- Heuristics
- 1997
(Show Context)
Citation Context ...en as possible in the shortest clauses of '. The hope is that by assigning such literals, we will have the largest amount of simplification. The unit heuristic is based on the one implemented in SATZ =-=[10]-=-. As opposed to b ohm and jw2, the unit heuristic tentatively assigns truth values to atoms in order to get the exact amount of simplification caused by such assignments. Independently from the partic... |

47 | A fast parallel SAT-solver - efficient workload balancing
- Böhm, Speckenmeyer
- 1996
(Show Context)
Citation Context ...rals in C (-length exists) as in [6]. By combining these options, six different branching heuristics are possible. The b ohm and jw2 heuristics are, respectively, a generalization of Bohm's heuristic =-=[8] and "-=-;two-sided Jeroslow-Wang" heuristic [9] for SAT. The idea behind b ohm and jw2 is to choose literals that occur as often as possible in the shortest clauses of '. The hope is that by assigning su... |

43 | Beyond NP: The QSAT Phase Transition
- Gent, Walsh
- 1999
(Show Context)
Citation Context ...ces on all the problems, and are thus the default. The tests run on a Pentium III, 600MHz, 128MBRAM. We consider sets of randomly generated QBFs. We generate QBFs according to model A as described in =-=[12]-=-. In this model, each QBF has the following 4 properties: (i) the prefix consists of k sequences, each sequence has n quantifiers, and any two quantifiers in a sequence, are of the same type, (ii) the... |

25 |
Resolution for quantified Boolean formulas
- Kleine-Büning, Karpinski, et al.
- 1995
(Show Context)
Citation Context .... Whenever QUBE exceeds <n1> seconds of CPU time (resp. <n2> megs of RAM), its execution is halted. 5 QUBE performances To evaluate QUBE performances, we compare it with DECIDE [5], EVALUATE [4], QKN =-=[11]-=-, and QSOLVE [6]. According to our preliminary experimental results, the options -heuristics bohm -length exists give good performances on all the problems, and are thus the default. The tests run on ... |