Computing Stable Models for Nonmonotonic Existential Rules

From korrekt.org

Jump to: navigation, search


Despoina Magka, Markus Krötzsch, Ian Horrocks

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.

Published at IJCAI 2013 (Conference paper)

Download PDF (last update: Apr 2 2013)

Citation details

  • Despoina Magka, Markus Krötzsch, Ian Horrocks. Computing Stable Models for Nonmonotonic Existential Rules. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI-13), pp. 1031–1038. IJCAI 2013.

Remarks

The PDF linked above is the camera ready version of the IJCAI paper. For further details, please see the extended technical report with full proofs.

Topics

Rule languages, nonmonotonic reasoning, stable models

Personal tools