Computing Stable Models for Nonmonotonic Existential Rules
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.
Cite
Text
Magka et al. "Computing Stable Models for Nonmonotonic Existential Rules." International Joint Conference on Artificial Intelligence, 2013.Markdown
[Magka et al. "Computing Stable Models for Nonmonotonic Existential Rules." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/magka2013ijcai-computing/)BibTeX
@inproceedings{magka2013ijcai-computing,
title = {{Computing Stable Models for Nonmonotonic Existential Rules}},
author = {Magka, Despoina and Krötzsch, Markus and Horrocks, Ian},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2013},
pages = {1031-1038},
url = {https://mlanthology.org/ijcai/2013/magka2013ijcai-computing/}
}