52 search results - page 5 / 11 » Encoding Quantified CSPs as Quantified Boolean Formulae |
91
Voted
DLOG
2008
15 years 1 months ago
2008
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
FORMATS
2005
Springer
15 years 5 months ago
2005
Springer
We define quantitative similarity functions between timed transition systems that measure the degree of closeness of two systems as a real, in contrast to the traditional boolean ...
JSYML
2006
14 years 11 months ago
2006
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...
AAECC
1999
Springer
14 years 11 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
121
click to vote
JAR
2000
14 years 11 months ago
2000
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...