150 search results - page 20 / 30 » The Stable Models of a Predicate Logic Program |
106
click to vote
ECP
1997
Springer
15 years 3 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
91
Voted
AAAI
2004
15 years 1 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
149
Voted
LPKR
1997
Springer
15 years 3 months ago
1997
Springer
Abstract. We study the relationship between argumentation (abduction) and disjunctive logic programming. Based on the paradigm of argumentation, an abductive semantic framework for...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
192
Voted
PADL
2009
Springer
16 years 9 days ago
2009
Springer
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...