Sciweavers

3691 search results - page 111 / 739
» Bayesian Logic Programs
Sort
View
LPKR
1997
Springer
15 years 4 months ago
A System for Abductive Learning of Logic Programs
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
Evelina Lamma, Paola Mello, Michela Milano, Fabriz...
88
Voted
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 22 days ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper
CONSTRAINTS
2004
129views more  CONSTRAINTS 2004»
15 years 16 days ago
CLPGUI: A Generic Graphical User Interface for Constraint Logic Programming
Abstract. CLPGUI is a generic graphical user interface for visualizing and controlling the execution of constraint logic programs. CLPGUI has been designed to be used in different ...
François Fages, Sylvain Soliman, Rém...
LOPSTR
2004
Springer
15 years 6 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
84
Voted
WLP
1997
Springer
15 years 4 months ago
Extending Homeomorphic Embedding in the Context of Logic Programming
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
Michael Leuschel