33 search results - page 6 / 7 » Naming Proofs in Classical Propositional Logic |
ESOP
2009
Springer
13 years 9 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
AGP
1995
IEEE
13 years 9 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
CADE
2011
Springer
12 years 5 months ago
2011
Springer
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...
LFCS
2007
Springer
13 years 11 months ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
RELMICS
2000
Springer
13 years 9 months ago
2000
Springer
Abstract: The Duration Calculus is an interval logic introduced for designing realtime systems. This calculus is able to capture important real-time problems like the speci cation ...