31 search results - page 1 / 7 » Complexity Results for Quantified Boolean Formulae Based on ... |
JSAT
2006
13 years 4 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
SIGECOM
2003
ACM
13 years 10 months ago
2003
ACM
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
AIML
2006
13 years 6 months ago
2006
In [9] we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complet...
PPDP
2009
Springer
13 years 11 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
ICDT
2009
ACM
14 years 5 months ago
2009
ACM
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...