Concrete Results on Abstract Rules

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

Concrete Results on Abstract Rules

Markus KrötzschMarkus Krötzsch,  Despoina MagkaDespoina Magka,  Ian HorrocksIan Horrocks
Concrete Results on Abstract Rules


Markus Krötzsch, Despoina Magka, Ian Horrocks
Concrete Results on Abstract Rules
Proc. 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'13), 414-426, September 2013. Springer
  • KurzfassungAbstract
    There are many different notions of “rule” in the literature. A key feature and main intuition of any such notion is that rules can be “applied” to derive conclusions from certain premises. More formally, a rule is viewed as a function that, when invoked on a set of known facts, can produce new facts. In this paper, we show that this extreme simplification is still sufficient to obtain a number of useful results in concrete cases. We define abstract rules as a certain kind of functions, provide them with a semantics in terms of (abstract) stable models, and explain how concrete normal logic programming rules can be viewed as abstract rules in a variety of ways. We further analyse dependencies between abstract rules to recognise classes of logic programs for which stable models are guaranteed to be unique.
  • Weitere Informationen unter:Other info: Link
  • Forschungsgruppe:Research Group: Wissensbasierte Systeme
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-40564-8_41.
@inproceedings{KMH2013,
  author    = {Markus Kr{\"{o}}tzsch and Despoina Magka and Ian Horrocks},
  title     = {Concrete Results on Abstract Rules},
  booktitle = {Proc. 12th International Conference on Logic Programming and
               Nonmonotonic Reasoning (LPNMR'13)},
  publisher = {Springer},
  year      = {2013},
  month     = {September},
  pages     = {414-426},
  doi       = {10.1007/978-3-642-40564-8_41}
}