×

QUBE

swMATH ID: 11381
Software Authors: Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando
Description: QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability. 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 deciding QBFs satisfiability. We start our presentation in § 2 with some terminology and definitions necessary for the rest of the paper. In § 3 we present a high level description of QuBE’s basic algorithm. QuBE’s available options are described in § 4. We end our presentation in § 5 with some experimental results showing QuBE effectiveness in comparison with other systems. QuBE, and more information about QuBE, are available at www.mrg.dist.unige.it/star/qube.
Homepage: http://link.springer.com/chapter/10.1007/3-540-45744-5_27
Related Software: QuBE++; Quaffle; Chaff; semprop; DepQBF; MiniSat; sKizzo; Quantor; Bloqqer; CirQit2; QUBOS; Nenofex; QBFLIB; sQueezeBF; MOCHA; SPASS; MPIDepQBF; QMiraXT; SATO; Mjollnir
Referenced in: 26 Publications

Referencing Publications by Year