158 search results - page 13 / 32 » Coinductive Logic Programming with Negation |
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...
FOIKS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
134
Voted
ICLP
1994
Springer
15 years 3 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
87
Voted
EPIA
2005
Springer
15 years 5 months ago
2005
Springer
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The dist...
88
Voted
ICLP
1991
Springer
15 years 3 months ago
1991
Springer
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...