90 search results - page 2 / 18 » Discovering Classes of Strongly Equivalent Logic Programs |
LPNMR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
LPNMR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
LPNMR
2007
Springer
13 years 11 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
LANMR
2007
13 years 6 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...