64 search results - page 3 / 13 » Inductive Logic Programming: Derivations, Successes and Shor... |
BIRTHDAY
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
ILP
2004
Springer
13 years 11 months ago
2004
Springer
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...
LICS
1995
IEEE
13 years 9 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
ENTCS
2002
13 years 5 months ago
2002
The Ambient Calculus has been recently proposed as a model of mobility of agents in a dynamically changing hierarchy of domains. In this paper, we describe the implementation of t...
TLCA
2009
Springer
14 years 8 days ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...