Applying visible strong equivalence in answer-set program transformations

Authors:
Tomi Janhunen;Ilkka Niemelä
Affiliations:
Department of Information and Computer Science, Aalto University, Aalto, Finland;Department of Information and Computer Science, Aalto University, Aalto, Finland
Venue:
Correct Reasoning
Year:
2012

Citing 22
Cited 0

Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
Logic programs with classical negation

Logic programming
Splitting a logic program

Proceedings of the eleventh international conference on Logic programming
Answer set planning

Proceedings of the 1999 international conference on Logic programming
Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Extending and implementing the stable model semantics

Artificial Intelligence
Strong Equivalence for Logic Programs and Default Theories (Made Easy)

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Strong equivalence made easy: nested expressions and weight constraints

Theory and Practice of Logic Programming
Equilibrium logic

Annals of Mathematics and Artificial Intelligence
Semantical characterizations and complexity of equivalences in answer set programming

ACM Transactions on Computational Logic (TOCL)
Automated Verification of Weak Equivalence within the smodels System*

Theory and Practice of Logic Programming
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
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The Conflict-Driven Answer Set Solver clasp: Progress Report

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Properties and applications of programs with monotone and convex constraints

Journal of Artificial Intelligence Research
Computing circumscription

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Modularity aspects of disjunctive stable models

Journal of Artificial Intelligence Research
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
Compact translations of non-disjunctive answer set programs to propositional clauses

Logic programming, knowledge representation, and nonmonotonic reasoning
Answer set programming at a glance

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

Strong equivalence is one of the basic notions of equivalence that have been proposed for logic programs subject to the answer-set semantics. In this paper, we propose a new generalization of strong equivalence which takes the visibility of atoms into account and we characterize it in terms of revised SE-models. Our design resembles (relativized) strong equivalence but is essentially different due to the strict correspondence of models adopted from the notion of visible equivalence. We illustrate the use of visible strong equivalence when showing correct program transformations introducing lots of auxiliary atoms. Moreover, we present a translation which enables us to automate the task of verifying the visible strong equivalence of smodels programs having enough visible atoms.