Sciweavers

97 search results - page 1 / 20
» Computing Stable and Partial Stable Models of Extended Disju...
Sort
View
NMELP
1994
13 years 9 months ago
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
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...
Carolina Ruiz, Jack Minker
ASP
2003
Springer
13 years 10 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...
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 4 months ago
Logic Programming with Ordered Disjunction
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...
Gerhard Brewka
LPNMR
2007
Springer
13 years 11 months ago
Modularity Aspects of Disjunctive Stable Models
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Ste...
ICLP
2003
Springer
13 years 10 months ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
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...
Thomas Eiter, Michael Fink