Sciweavers

52 search results - page 5 / 11
» Encoding Quantified CSPs as Quantified Boolean Formulae
Sort
View
DLOG
2008
13 years 10 months ago
Checking DL-Lite Modularity with QBF Solvers
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...
Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...
FORMATS
2005
Springer
14 years 1 months ago
Quantifying Similarities Between Timed Systems
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 ...
Thomas A. Henzinger, Rupak Majumdar, Vinayak S. Pr...
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
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
13 years 7 months ago
Reasoning over Networks by Symbolic Methods
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...
Thomas Sturm
JAR
2000
145views more  JAR 2000»
13 years 7 months ago
Logical Cryptanalysis as a SAT Problem
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...
Fabio Massacci, Laura Marraro