140 search results - page 7 / 28 » Stable Models and Non-Determinism in Logic Programs with Neg... |
LPKR
1997
Springer
15 years 3 months ago
1997
Springer
In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different typ...
109
click to vote
LANMR
2007
15 years 1 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...
131
click to vote
ICLP
2003
Springer
15 years 4 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...
113
click to vote
ASP
2003
Springer
15 years 4 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...
120
click to vote
CORR
2004
Springer
14 years 11 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...