Computing Stable Models for Nonmonotonic Existential Rules
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 1031-1037.
Abstract
In this work, we consider function-free existential rules extended with nonmonotonic negation under a stable model semantics. We present new acyclicity and stratification conditions that identify a large class of rule sets having finite, unique stable models, and we show how the addition of constraints on the input facts can further extend this class. Checking these conditions is computationally feasible, and we provide tight complexity bounds. Finally, we demonstrate how these new methods allowed us to solve relevant reasoning problems over a real-world knowledge base from biochemistry using an off-the-shelf answer set programming engine.
@inproceedings{ijcai2013p157,
title = {Computing Stable Models for Nonmonotonic Existential Rules},
author = {Magka, Despoina and Krötzsch, Markus and Horrocks, Ian},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {1031--1037},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/157},
}
TY - CPAPER TI - Computing Stable Models for Nonmonotonic Existential Rules AU - Magka, Despoina AU - Krötzsch, Markus AU - Horrocks, Ian T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 1031 EP - 1037 UR - https://ijcai.org/proceedings/2013/157 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
