Sciweavers

168 search results - page 3 / 34
» On Models for Quantified Boolean Formulas
Sort
View
ICAI
2009
13 years 5 months ago
An Alternative Representation for QBF
Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused...
Anja Remshagen, Klaus Truemper
JSYML
2006
85views more  JSYML 2006»
13 years 7 months ago
An alternative semantics for quantified relevant logic
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
Robert Goldblatt, Edwin D. Mares
APAL
2004
73views more  APAL 2004»
13 years 7 months ago
Shrinking games and local formulas
Gaifman's normal form theorem showed that every first order sentence of quantifier rank n is equivalent to a Boolean combination of "scattered local sentences", whe...
H. Jerome Keisler, Wafik Boulos Lotfallah
CADE
2005
Springer
14 years 8 months ago
sKizzo: A Suite to Evaluate and Certify QBFs
We present sKizzo, a system designed to evaluate and certify Quantified Boolean Formulas (QBFs) by means of propositional skolemization and symbolic reasoning.
Marco Benedetti