168 search results - page 10 / 34 » On Models for Quantified Boolean Formulas |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
AIML
2006
13 years 9 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...
JAR
2000
13 years 7 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...
KBSE
2007
IEEE
14 years 1 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...