Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag):
C. Feier:
"Worst-Case Optimal Reasoning with Forest Logic Programs";
Vortrag: 13th International Conference on Principles of Knowledge Representation and Reasoning,
Rome, Italy;
10.06.2012
- 14.06.2012; in: "13th International Conference on Principles of Knowledge Representation and Reasoning",
G. Brewka, T. Eiter, S. McIlraith (Hrg.);
AAAI Press,
(2012),
ISBN: 978-1-57735-561-8;
S. 608
- 612.
Kurzfassung englisch:
The paper introduces a worst-case optimal tableau algorithm for reasoning with Forest Logic Programs, a decidable fragment of Open Answer Set Programming. FoLPs are a useful device for tight integration of the Description Logic and the Logic Programming worlds:
reasoning with the DL SHOQ can be simulated within the fragment. The algorithm reuses a knowledge compilation technique previously introduced, but improves on previous results by decreasing the worst-case running time with one exponential level. The decrease in
complexity is due to the usage in conjunction of a new redundancy and of a new caching rule.
Zugeordnete Projekte:
Projektleitung Thomas Eiter:
Schließen in hybriden Wissensbasen
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.