Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection

Authors:
Jörg Pührer;Hans Tompits
Affiliations:
Institut für Informationssysteme 184/3, Technische Universität Wien, Vienna, Austria A---1040;Institut für Informationssysteme 184/3, Technische Universität Wien, Vienna, Austria A---1040
Venue:
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
2009

Citing 6
Cited 3

Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Strong equivalence made easy: nested expressions and weight constraints

Theory and Practice of Logic Programming
Semantical characterizations and complexity of equivalences in answer set programming

ACM Transactions on Computational Logic (TOCL)
A common view on strong, uniform, and other notions of equivalence in answer-set programming*

Theory and Practice of Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1

Theory and Practice of Logic Programming
On solution correspondences in answer-set programming

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there*

Theory and Practice of Logic Programming
Exploring relations between answer set programs

Logic programming, knowledge representation, and nonmonotonic reasoning
Applying visible strong equivalence in answer-set program transformations

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at studying conditions under which certain syntactic constructs can be eliminated from programs preserving some given equivalence relation. In this paper, we continue this endeavour introducing novel conditions under which disjunction and negation can be eliminated from answer-set programs under relativised strong equivalence with projection . This notion is a generalisation of the usual strong-equivalence relation, as introduced by Lifschitz, Pearce, and Valverde, by allowing parametrisable context and output alphabets, which is an important feature in view of practical programming techniques like the use of local variables and modules. We provide model-theoretic conditions that hold for a disjunctive logic program P precisely when there is a program Q , equivalent to P under our considered notion, such that Q is either positive , normal , or Horn , respectively. Moreover, we outline how such a Q , called a casting of P , can be obtained, and consider complexity issues.