E. Giunchiglia, M. Narizzano, and A. Tacchella. Qube: A system for deciding quantified boolean formulas satisfiabilit. In In Proc. International Joint Conference on Automated Reasoning (IJCAR - 01), 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Computing Solutions to Belief Change Scenarios - Delgrande, al. (2003) (Correct)
....of our approach is to translate (in polynomial time) a given reasoning task into the evaluation problem for QBFs and then use a QBF evaluator to compute the resultant instances. The existence of efficient QBF solvers, such as the systems developed by Cadoli et al. 4] Giunchiglia et al. [18] , Rintanen [32] or Feldmann et al. 15] makes such a rapid prototyping approach practicably applicable. A similar approach for solving various reasoning tasks belonging to the area of nonmonotonic reasoning has been realized in the system QUIP [12; 11; 27] This prototype implementation ....
E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In Proceedings of the International Joint Conference on Automated Reasoning, pages 364--369, 2001.
Modal Nonmonotonic Logics Revisited: Efficient.. - Eiter, Klotz.. (2002) (Correct)
....The central idea is to translate a given reasoning task into a quantified Boolean formula (QBF) and then applying some sophisticated QBF solver to evaluate the translated QBF. The existence of efficient QBF solvers, like, e.g. the systems developed by Cadoli et al. 5] Giunchiglia et al. [18], Rintanen [37] Letz [25] or Feldmann et al. 15] makes this reduction approach practicably applicable. Concerning the particular reductions, we provide efficient (polynomial time) translations of reasoning tasks for the following modal nonmonotonic logics: Moore s autoepistemic logic [29] ....
....applied to conditional planning [36] In order to conduct some experimental evaluation of our translations, we tested their implementation in the system QUIP based on a class of benchmark problems using different underlying QBF solvers. More specifically, we used the solvers ssolve [15] QuBe [18], and semprop [25] on randomly generated problem instances covering a complete easy hard easy pattern. 2 Preliminaries We deal with propositional languages and use the logical symbols , and to construct formulas in the standard way. We write LP to denote a language over an ....
[Article contains additional citation context not shown here]
E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In Proc. IJCAR-01, pages 364--369, 2001.
Qubos: Deciding Quantified Boolean Logic using Propositional.. - Ayari, Basin (2002) (Correct)
....of maturity; there are many success stories where SAT solvers such as [11, 19, 22] have been successfully applied to industrial scale problems. However, the picture for QBL is rather di#erent. Despite the growing body of research on this topic, the current generation of Q(uantified)SAT solvers [8, 10, 15] are still in their infancy. These tools work by translating QBL formulae to formulae in a quantified clausal normal form and applying extensions of the Davis Putnam method to the result. The extensions concern generalizing Davis Putnam heuristics such as unit propagation and backjumping. These ....
Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. QuBE: A system for deciding Quantified Boolean Formulas Satisfiability. In Proceedings of the International Joint Conference on Automated Reasoning (IJCAR'01), June 2001.
On the Effectiveness of Backjumping and Trivial.. - Giunchiglia.. (2001) Self-citation (Giunchiglia Narizzano Tacchella) (Correct)
....Neither of these two optimizations subsumes the other: it is easy to come up with examples in which trivial truth behaves much better than backjumping, and the other way around. In this paper we experimentally compare trivial truth and backjumping. The comparison is done using the QUBE system [4]. While trivial truth is implemented by various QBF solvers like EVALUATE [1] and QSOLVE [5] QUBE is as far as we know the only system with a backjumping optimization built in. The experimental analysis is performed on a combination of random kQBFs (see [2] generated according to model A ....
....values. As matter of fact, all the experiments have been run with the same version of ChooseLiteral , i.e. Bohm s heuristic [13] for SAT, modified as in [5] to consider existential literals only. Other configurations of QUBE, including those that we do not take into account here, are described in [4] to which we refer the reader for further details. 2.2 Testing Methodology To experiment with various settings of QUBE and to compare it with other state ofthe art solvers, 1 we have considered sets of random QBFs generated according to the model A as described in [6] With this model, each ....
E. Giunchiglia, M. Narizzano, and A. Tacchella. QuBE: a system for Deciding Quantified Boolean Formulas Satisfiability. In Proc. of IJCAR, 2001.
Backjumping for Quantified Boolean Logic Satisfiability - Giunchiglia, Narizzano.. (2001) (6 citations) Self-citation (Giunchiglia Narizzano Tacchella) (Correct)
....deleting the clauses in which l occurs, and removing l from the others. It is easy to see that if is a QBF without universal quantifiers, the problem of deciding satisfiability reduces to SAT. 3 QUBE QUBE is implemented in C on top of SIM, an efficient decider for SAT developed by our group [Giunchiglia et al. 2001a] A high level description of QUBE is presented in Figure 1. 2 In Figure 1, is a global variable initially set to the input QBF. 1 Traditionally, the syntax of QBFs allows for arbitrary propositional formulas as matrices. However, the problem of determining the satisfiability of a QBF ....
....results, and the test sets used are available at QUBE web page: www.mrg.dist.unige.it star qube. QUBE, besides the backjumping procedure above described, features six different branching heuristics, plus an adaptation of trivial truth (see [Cadoli et al. 1998, Cadoli et al. 2000] See [Giunchiglia et al. 2001b] for a description of QUBE s available options. About trivial truth, backjumping and their interactions, we have conducted an experimental evaluation on this. The result is that neither trivial truth is always better than backjumping, nor the other way around. On the other hand, the overhead of ....
[Article contains additional citation context not shown here]
Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. QUBE: A system for deciding quantified boolean formulas satisfiability. In Proc. of the International Joint Conference on Automated Reasoning (IJCAR'2001), 2001.
Submitted to the Department of Electrical Engineering and.. - Science In Partial (Correct)
No context found.
E. Giunchiglia, M. Narizzano, and A. Tacchella. Qube: A system for deciding quantified boolean formulas satisfiabilit. In In Proc. International Joint Conference on Automated Reasoning (IJCAR - 01), 2001.
On Computing Belief Change Operations Using Quantified.. - Delgrande, Schaub, al. (Correct)
No context found.
E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A system for deciding quantified Boolean formulas satisfiability. In Proceedings of the First International Joint Conference on Automated Reasoning (IJCAR 2001.
Boolean Quantification - In First-Order Context (Correct)
No context found.
Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. QuBE: A system for deciding quantified boolean formulas satisfiability. In Proceedings of the International Joint Conference on Automated Reasoning (IJCAR'01), Siena, Italy, June 2001. 25
A Polynomial Translation of Logic Programs with.. - Pearce, Sarsakov, .. (2002) (6 citations) (Correct)
No context found.
E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In Proc. IJCAR-01, pages 364--369, 2001.
A Constraint-Propagation Approach to Quantified Constraints - Bordeaux (Correct)
No context found.
E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A system for deciding quantified boolean formulas satisfiability. In Proc. of the 1st Int. Joint Conf. on Automated Reasoning (IJCAR), LNCS, pages 364--369, Siena, Italy, 2001. Springer.
Paraconsistent Reasoning via Quantified Boolean.. - Besnard, Schaub.. (Correct)
No context found.
E. Giunchiglia, M. Narizzano, and A. Tacchella. QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In Proc. IJCAR-01, pages 364--369. Springer Verlag, 2001.
On Deciding Subsumption Problems - Egly, Pichler, Woltran (2003) (1 citation) (Correct)
No context found.
Giunchiglia, E., M. Narizzano, and A. Tacchella: 2001, `QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability'. In: R. Gore, A. Leitsch, and T. Nipkow (eds.): Proceedings of the International Joint Conference on Automated Reasoning (IJCAR'01). pp. 364--369.
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