261 search results - page 14 / 53 » Proof Normalization Modulo |
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
DDECS
2009
IEEE
14 years 1 months ago
2009
IEEE
—Automatic Test Pattern Generation (ATPG) based on Boolean satisfiability (SAT) has been shown to be a beneficial complement to traditional ATPG techniques. Boolean solvers wor...
AMAI
2008
Springer
13 years 6 months ago
2008
Springer
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....
LACL
1998
Springer
13 years 10 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...