Skip to main content
SpringerLink
Log in

Reasoning with Forest Logic Programs Using Fully Enriched Automata

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9345))

  • 768 Accesses

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.

Work supported by the EPSRC grants Score! and DBOnto and the FWF grant P24090.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Constants have no predecessors, hence there are no adorned downward predicates in the label.

References

  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)

    Article  MathSciNet  Google Scholar 

  2. Feier, C.: Worst-case optimal reasoning with forest logic programs. In: Proceedings of the KR, 2012, 208–212 (2012)

    Google Scholar 

  3. Feier, C.: Reasoning with Forest Logic Programs, Ph.D thesis, TU Wien (2014)

    Google Scholar 

  4. Feier, C., Heymans, S.: Reasoning with forest logic programs and f-hybrid knowledge bases. TPLP 3(13), 395–463 (2013)

    MathSciNet  Google Scholar 

  5. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP 1988, pp. 1070–1080 (1988)

    Google Scholar 

  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. Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Open answer set programming for the semantic web. J. Appl. Logic 5(1), 144–169 (2007)

    Article  MATH  Google Scholar 

  8. Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Open answer set programming with guarded programs. Trans. Comput. Logic 9(4), 1–53 (2008)

    Article  MathSciNet  Google Scholar 

  9. Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. J. Web Semant. 3(1), 41–60 (2005)

    Article  Google Scholar 

  10. Rosati, R.: On combining description logic ontologies and nonrecursive datalog rules. In: Proceedings of the RR, pp. 13–27 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Oxford, Oxford, UK

    Cristina Feier

  2. Institute of Information Systems, Vienna University of Technology, Vienna, Austria

    Thomas Eiter

Authors
  1. Cristina Feier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Eiter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cristina Feier .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Francesco Calimeri

  2. University of Calabria, Rende, Italy

    Giovambattista Ianni

  3. University of Kentucky Dept. Computer Science, Lexington, Kentucky, USA

    Miroslaw Truszczynski

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Feier, C., Eiter, T. (2015). Reasoning with Forest Logic Programs Using Fully Enriched Automata. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. Lecture Notes in Computer Science(), vol 9345. Springer, Cham. https://doi.org/10.1007/978-3-319-23264-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23264-5_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23263-8

  • Online ISBN: 978-3-319-23264-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation