A Comparative Study of Logic Programs with Preference
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 597-601.
Abstract
We are interested in semantical underpinnings for existing approaches to preference handling in extended logic programming (within the framework of answer set programming). As a starting point, we explore three different approaches that have been recently proposed in the literature. Because these approaches use rather different formal means, we furnish a series of uniform characterizations that allow us to gain insights into the relationships among these approaches. To be more precise, we provide different characterizations in terms of (i) fixpoints, (ii) order preservation, and (iii) translations into standard logic programs. While the two former provide semantics for logic programming with preference information, the latter furnishes implementation techniques for these approaches.
@inproceedings{ijcai2001p83,
title = {A Comparative Study of Logic Programs with Preference},
author = {Schaub, Torsten and Wang, Kewen},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {597--601},
year = {2001},
url = {https://ijcai.org/proceedings/2001/83},
}
TY - CPAPER TI - A Comparative Study of Logic Programs with Preference AU - Schaub, Torsten AU - Wang, Kewen T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 597 EP - 601 UR - https://ijcai.org/proceedings/2001/83 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
