977 search results - page 50 / 196 » Logic programming with infinite sets |
125
Voted
LISP
2008
15 years 12 days ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
104
click to vote
AIIA
1997
Springer
15 years 4 months ago
1997
Springer
We propose an approach for the integration of abduction and induction in Logic Programming. In particular, we show how it is possible to learn an abductive logic program starting f...
110
click to vote
ICLP
2003
Springer
15 years 5 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
118
click to vote
ALT
2004
Springer
15 years 9 months ago
2004
Springer
Probabilistic inductive logic programming, sometimes also called statistical relational learning, addresses one of the central questions of artificial intelligence: the integratio...
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...