3481 search results - page 157 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
106
click to vote
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
148
click to vote
LPKR
1997
Springer
15 years 7 months ago
1997
Springer
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...
111
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
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...
132
click to vote
LOPSTR
2004
Springer
15 years 8 months ago
2004
Springer
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...
107
click to vote
WLP
1997
Springer
15 years 7 months ago
1997
Springer
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...