247 search results - page 5 / 50 » Stable models and an alternative logic programming paradigm |
LANMR
2007
14 years 11 months ago
2007
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
102
click to vote
AGP
2003
IEEE
15 years 2 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 ...
118
click to vote
ICLP
2003
Springer
15 years 2 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
ASP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and str...
106
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...