Advertisement

Reasoning with Forest Logic Programs Using Fully Enriched Automata

  • Cristina FeierEmail author
  • Thomas Eiter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9345)

Abstract

Forest Logic Programs (FoLP) are a decidable fragment of Open Answer Set Programming (OASP) which have the forest model property. OASP extends Answer Set Programming (ASP) with open domains—a feature which makes it possible for FoLPs to simulate reasoning with the description logic \(\mathcal {SHOQ}\). In the past, several tableau algorithms have been devised to reason with FoLPs, the most recent of which established a NExpTime upper bound for reasoning with the fragment. While known to be ExpTime-hard, the exact complexity characterization of reasoning with FoLPs was still unknown. In this paper we settle this open question by a reduction of reasoning with FoLPs to emptiness checking of fully enriched automata which are known to be ExpTime-complete.

References

  1. 1.
    Bonatti, P.A., Lutz, C., Murano, A., Vardi, M.Y.: The complexity of enriched \(\mu \)-calculi. Log. Methods Comput. Sci. 4(3), 1–27 (2008)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Feier, C.: Worst-case optimal reasoning with forest logic programs. In: Proceedings of the KR, 2012, 208–212 (2012)Google Scholar
  3. 3.
    Feier, C.: Reasoning with Forest Logic Programs, Ph.D thesis, TU Wien (2014)Google Scholar
  4. 4.
    Feier, C., Heymans, S.: Reasoning with forest logic programs and f-hybrid knowledge bases. TPLP 3(13), 395–463 (2013)MathSciNetGoogle Scholar
  5. 5.
    Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP 1988, pp. 1070–1080 (1988)Google Scholar
  6. 6.
    Heymans, S.: Decidable Open Answer Set Programming. Ph.D thesis, Theoretical Computer Science Lab (TINF), Department of Computer Science, Vrije Universiteit Brussel (2006)Google Scholar
  7. 7.
    Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Open answer set programming for the semantic web. J. Appl. Logic 5(1), 144–169 (2007)zbMATHCrossRefGoogle Scholar
  8. 8.
    Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Open answer set programming with guarded programs. Trans. Comput. Logic 9(4), 1–53 (2008)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. J. Web Semant. 3(1), 41–60 (2005)CrossRefGoogle Scholar
  10. 10.
    Rosati, R.: On combining description logic ontologies and nonrecursive datalog rules. In: Proceedings of the RR, pp. 13–27 (2008)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of OxfordOxfordUK
  2. 2.Institute of Information SystemsVienna University of TechnologyViennaAustria

Personalised recommendations