248 search results - page 16 / 50 » On the existence of stable models of non-stratified logic pr... |
87
Voted
NMR
2004
Springer
15 years 5 months ago
2004
Springer
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
101
Voted
NMR
2004
Springer
15 years 5 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
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
click to vote
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...
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
We pursue a representation of logic programs as classical first-order sentences. Different semantics for logic programs can then be expressed by the way in which they are wrapped...