Concrete Results on Abstract Rules

Markus KrötzschMarkus Krötzsch, Despoina MagkaDespoina Magka, Ian HorrocksIan Horrocks

ISBN: 978-3-642-40564-8
ISSN: 0302-9743
Download
DOI Link

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

Details
Bibtex

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.
Bemerkung: Note: Full proofs can be found in the extended technical report of this work.
Weitere Informationen unter:Further Information: Link
Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems

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}
}