6554 search results - page 250 / 1311 » Constraint Logic Programming |
162
click to vote
ESWS
2009
Springer
16 years 1 months ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
151
click to vote
LPNMR
2005
Springer
16 years 11 hour 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 ...
203
click to vote
LPKR
1997
Springer
15 years 10 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...
158
click to vote
CORR
2006
Springer
15 years 6 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...
177
click to vote
LOPSTR
2004
Springer
15 years 12 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...