Computing Stable Models for Nonmonotonic Existential Rules

From International Center for Computational Logic

Toggle side column

Computing Stable Models for Nonmonotonic Existential Rules

Despoina MagkaDespoina Magka,  Markus KrötzschMarkus Krötzsch,  Ian HorrocksIan Horrocks
Computing Stable Models for Nonmonotonic Existential Rules


Despoina Magka, Markus Krötzsch, Ian Horrocks
Computing Stable Models for Nonmonotonic Existential Rules
Proc. 23rd International Joint Conference on Artificial Intelligence (IJCAI'13), 1031-1038, August 2013. AAAI Press
  • KurzfassungAbstract
    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.
  • Weitere Informationen unter:Further Information: Link
  • Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@inproceedings{MKH2013,
  author    = {Despoina Magka and Markus Kr{\"{o}}tzsch and Ian Horrocks},
  title     = {Computing Stable Models for Nonmonotonic Existential Rules},
  booktitle = {Proc. 23rd International Joint Conference on Artificial
               Intelligence (IJCAI'13)},
  publisher = {AAAI Press},
  year      = {2013},
  month     = {August},
  pages     = {1031-1038}
}