This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question f...
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...
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 ...