Sciweavers

4 search results - page 1 / 1
» Cut-elimination and Redundancy-elimination by Resolution
Sort
View
CADE
1999
Springer
13 years 9 months ago
System Description: CutRes 0.1: Cut Elimination by Resolution
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
Matthias Baaz, Alexander Leitsch, Georg Moser
CADE
2004
Springer
14 years 5 months ago
A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
Yevgeny Kazakov, Hans de Nivelle
CADE
1998
Springer
13 years 9 months ago
A Resolution Decision Procedure for the Guarded Fragment
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
Hans de Nivelle
LICS
1999
IEEE
13 years 9 months ago
A Superposition Decision Procedure for the Guarded Fragment with Equality
We give a new decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. We argue that this method will be more useful in ...
Harald Ganzinger, Hans de Nivelle