Sciweavers

439 search results - page 43 / 88
» Instantiation-Based Automated Reasoning: From Theory to Prac...
Sort
View
TPHOL
2003
IEEE
15 years 3 months ago
First Order Logic with Domain Conditions
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. ...
Freek Wiedijk, Jan Zwanenburg
LICS
2002
IEEE
15 years 2 months ago
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types
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...
Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat
LICS
2003
IEEE
15 years 3 months ago
Polynomial-time Algorithms from Ineffective Proofs
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...
Paulo Oliva
RR
2010
Springer
14 years 8 months ago
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
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...
LICS
1999
IEEE
15 years 2 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