58 search results - page 6 / 12 » Normal Proofs in Intruder Theories |
TLCA
2005
Springer
14 years 3 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
SLP
1993
13 years 11 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
CADE
2005
Springer
14 years 10 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
AAAI
1994
13 years 11 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
CCL
1994
Springer
14 years 1 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...