A stronger notion of equivalence for logic programs

Authors:
Ka-Shu Wong
Affiliations:
University of New South Wales and National ICT Australia, Sydney, NSW, Australia
Venue:
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Year:
2007

Citing 3
Cited 0

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
Solving logic program conflict through strong and weak forgettings

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several different notions of equivalence have been proposed for logic programs with answer set semantics, most notably strong equivalence. However, strong equivalence is not preserved by certain logic program operators such as the strong and weak forgetting operators of Zhang and Foo. We propose a stronger notion of equivalence, called T-equivalence, which is preserved by these operators. We give a syntactic definition and provide a model-theoretic characterisation of T-equivalence. We show that strong and weak forgetting does preserve T-equivalence and using this, arrive at a model-theoretic definition of the strong and weak forgetting operators.