191 search results - page 4 / 39 » Propositional theories are strongly equivalent to logic prog... |
AMAI
2006
Springer
13 years 7 months ago
2006
Springer
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...
LPNMR
2005
Springer
14 years 1 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...
FOSSACS
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
LPNMR
2004
Springer
14 years 1 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...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...