Sciweavers

107 search results - page 14 / 22
» Reducing Propositional Theories in Equilibrium Logic to Logi...
Sort
View
CADE
2002
Springer
15 years 9 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
76
Voted
CSL
1995
Springer
15 years 1 months ago
Deduction by Combining Semantic Tableaux and Integer Programming
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
Bernhard Beckert, Reiner Hähnle
141
Voted
POPL
2011
ACM
14 years 11 days ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
CADE
2011
Springer
13 years 9 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
PLILP
1998
Springer
15 years 1 months ago
A Hidden Herbrand Theorem
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
Joseph A. Goguen, Grant Malcolm, Tom Kemp