Sciweavers

42 search results - page 1 / 9
» Modular Equivalence for Normal Logic Programs
Sort
View
ECAI
2006
Springer
13 years 8 months ago
Modular Equivalence for Normal Logic Programs
Emilia Oikarinen, Tomi Janhunen
AMAI
2006
Springer
13 years 4 months ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak
LPNMR
2005
Springer
13 years 10 months ago
On Modular Translations and Strong Equivalence
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
Paolo Ferraris
ASP
2003
Springer
13 years 10 months ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke
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