A structural approach to reasoning with quantified Boolean formulas
نویسندگان
چکیده
In this paper we approach the problem of reasoning with quantified Boolean formulas (QBFs) by combining search and resolution, and by switching between them according to structural properties of QBFs. We provide empirical evidence that QBFs which cannot be solved by search or resolution alone, can be solved by combining them, and that our approach makes a proof-of-concept implementation competitive with current QBF solvers.
منابع مشابه
STRUQS: A Structural QBF Solver
In this note we describe STRUQS, a solver that approaches the problem of reasoning with quantified Boolean formulas (QBFs) by combining search and resolution, and by switching between them according to structural properties of QBFs. Here it is described the version submitted to the competitive evaluation of QBF solvers 2010 (QBFEVAL’10), and it is based on the work presented in [1], and extende...
متن کاملSolving Advanced Reasoning Tasks Using Quantified Boolean Formulas
We consider the compilation of different reasoning tasks into the evaluation problem of quantified boolean formulas (QBFs) as an approach to develop prototype reasoning systems useful for, e.g., experimental purposes. Such a method is a natural generalization of a similar technique applied to NP-problems and has been recently proposed by other researchers. More specifically, we present translat...
متن کاملParaconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories
Through minimal-model semantics, three-valued logics provide an interesting formalism for capturing reasoning from inconsistent information. However, the resulting paraconsistent logics lack so far a uniform implementation platform. Here, we address this and specifically provide a translation of two such paraconsistent logics into the language of quantified Boolean formulas (QBFs). These formul...
متن کاملSolving Advanced Reasoning Tasks using Quanti ed Boolean Formulas
We consider the compilation of diierent reasoning tasks into the evaluation problem of quantiied boolean formulas (QBFs) as an approach to develop prototype reasoning systems useful, e.g., for experimental purposes. Such a method is a natural generalization of a similar technique applied to NP-problems and has been recently proposed by other researchers. More specifically , we present translati...
متن کاملModels and Sets Dynamics, Interaction and Nonmonotonicity Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
Signed systems were introduced as a general, syntaxindependent framework for paraconsistent reasoning, that is, nontrivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent consequence relations can be axiomatised by means of quantified Boolean formulas. This approach has several benefits. First, it furnishes an axiomatic specific...
متن کامل