36 search results - page 3 / 8 » On Eliminating Disjunctions in Stable Logic Programming |
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...
IJCAI
2007
13 years 7 months ago
2007
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
NMR
2004
Springer
13 years 11 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
AGP
2003
IEEE
13 years 11 months ago
2003
IEEE
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” nature ...
NMR
2004
Springer
13 years 11 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...