On Solution Correspondences in Answer-Set Programming
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 97-101.
Abstract
We introduce a general framework for specifying program correspondence under the answer-set semantics. The framework allows to define different kinds of equivalence notions, including previously defined notions like strong and uniform equivalence, in which programs are extended with rules from a given context, and correspondence is determined by means of a binary relation. In particular, refined equivalence notions based on projected answer sets can be defined within this framework, where not all parts of an answer set are of relevance. We study general characterizations of inclusion and equivalence problems, introducing novel semantical structures. Furthermore, we deal with the issue of determining counterexamples for a given correspondence problem, and we analyze the computational complexity of correspondence checking.
@inproceedings{ijcai2005p139,
title = {On Solution Correspondences in Answer-Set Programming},
author = {Eiter, Thomas and Tompits, Hans and Woltran, Stefan},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {97--101},
year = {2005},
url = {https://ijcai.org/proceedings/2005/139},
}
TY - CPAPER TI - On Solution Correspondences in Answer-Set Programming AU - Eiter, Thomas AU - Tompits, Hans AU - Woltran, Stefan T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 97 EP - 101 UR - https://ijcai.org/proceedings/2005/139 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
