[Back]

C. Feier:
"Worst-Case Optimal Reasoning with Forest Logic Programs";
Talk: 13th International Conference on Principles of Knowledge Representation and Reasoning, Rome, Italy; 2012-06-10 - 2012-06-14; in: "13th International Conference on Principles of Knowledge Representation and Reasoning", G. Brewka, T. Eiter, S. McIlraith (ed.); AAAI Press, (2012), ISBN: 978-1-57735-561-8; 608 - 612.

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.

Project Head Thomas Eiter:
Schließen in hybriden Wissensbasen