Sciweavers

23 search results - page 3 / 5
» On Avoiding Redundancy in Inductive Logic Programming
Sort
View
IJCAI
1993
14 years 11 months ago
Multiple Predicate Learning
We study multiple predicate learning in an empirical setting. Problems with existing inductive logic programming approaches in this setting are sketched and an empirical ILP syste...
Luc De Raedt, Nada Lavrac, Saso Dzeroski
68
Voted
FSTTCS
2007
Springer
15 years 4 months ago
Closures and Modules Within Linear Logic Concurrent Constraint Programming
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
Rémy Haemmerlé, François Fage...
108
Voted
ENTCS
2002
148views more  ENTCS 2002»
14 years 10 months ago
A Declarative Debugging System for Lazy Functional Logic Programs
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
Rafael Caballero, Mario Rodríguez-Artalejo
71
Voted
ECAI
2000
Springer
15 years 2 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
POPL
2010
ACM
14 years 10 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...