764 search results - page 3 / 153 » On the Expressibility of Stable Logic Programming |
NMELP
1994
13 years 9 months ago
1994
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened originally by Gelfond and Lifschitz G...
CORR
2002
Springer
13 years 5 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...
ICLP
2010
Springer
13 years 9 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...
LPNMR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
ASP
2001
Springer
13 years 10 months ago
2001
Springer
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...