Sciweavers

213 search results - page 5 / 43
» Logic programs with annotated disjunctions
Sort
View
LANMR
2007
13 years 9 months ago
Equivalence for the G3'-stable models semantics
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...
José Luis Carballido, José Arrazola,...
ICLP
2003
Springer
14 years 1 months ago
Order and Negation as Failure
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
Davy Van Nieuwenborgh, Dirk Vermeir
KR
2004
Springer
14 years 1 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
LPKR
1997
Springer
14 years 5 days ago
Disjunctive Logic Programming and Autoepistemic Logic
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...
Li-Yan Yuan, Jia-Huai You, Randy Goebel
ASP
2003
Springer
14 years 1 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...