Sciweavers

115 search results - page 3 / 23
» Representing First-Order Causal Theories by Logic Programs
Sort
View
BIRTHDAY
2004
Springer
13 years 10 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 3 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
IJCAI
2007
13 years 6 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 4 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
CADE
2005
Springer
14 years 5 months ago
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
Kaustuv Chaudhuri, Frank Pfenning