Sciweavers

48 search results - page 3 / 10
» jar 2006
Sort
View
JAR
2002
61views more  JAR 2002»
13 years 4 months ago
The IJCAR ATP System Competition
The results of the IJCAR ATP System Competition are presented.
Geoff Sutcliffe, Christian B. Suttner, Francis Jef...
JAR
1998
57views more  JAR 1998»
13 years 4 months ago
Signed Systems for Paraconsistent Reasoning
In [6] Besnard and Schaub elaborated a novel approach to paraconsistent reasoning which lead to a family of paraconsistent consequence relations. In a sense these try to safeguard...
Philippe Besnard, Torsten Schaub
JAR
2010
160views more  JAR 2010»
13 years 3 months ago
Declarative Representation of Proof Terms
Abstract. We present a declarative language inspired by the pseudonatural language used in Matita for the explanation of proof terms. We show how to compile the language to proof t...
Claudio Sacerdoti Coen
JAR
2002
77views more  JAR 2002»
13 years 4 months ago
Proof Reflection in Coq
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn indices for variable binding. The main judgement we model is of the form d [:] , ...
Dimitri Hendriks
JAR
1998
60views more  JAR 1998»
13 years 4 months ago
Elimination of Self-Resolving Clauses
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
Hans Jürgen Ohlbach