Skip to main content
Springer Nature Link
Log in

Automata for Ontologies

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9618))

Included in the following conference series:

Abstract

We present three reasoning problems for description logic ontologies and discuss how automata theory can be used to analyze them.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Artale, A., Kontchakov, R., Kovtunova, A., Ryzhikov, V., Wolter, F., Zakharyaschev, M.: First-order rewritability of temporal ontology-mediated queries. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, 25–31 July 2015, Buenos Aires, Argentina, pp. 2706–2712 (2015)

    Google Scholar 

  2. Baader, F., Bienvenu, M., Lutz, C., Wolter, F.: Query and predicate emptiness in description logics. In: Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning, KR 2010, 9–13 May 2010, Toronto, Ontario, Canada (2010)

    Google Scholar 

  3. Baader, F., Bienvenu, M., Lutz, C., Wolter, F.: Query and predicate emptiness in description logics. J. Artif. Intell. Res. (2016, to appear)

    Google Scholar 

  4. Baader, F., Hladik, J., Lutz, C., Wolter, F.: From tableaux to automata for description logics. Fundam. Inform. 57(2–4), 247–279 (2003)

    MathSciNet  MATH  Google Scholar 

  5. Baader, F., Peñaloza, R.: Automata-based axiom pinpointing. J. Autom. Reasoning 45(2), 91–129 (2010)

    Article  MATH  Google Scholar 

  6. Bienvenu, M., ten Cate, B., Lutz, C., Wolter, F.: Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. ACM Trans. Database Syst. 39(4), 33:1–33:44 (2014)

    Article  Google Scholar 

  7. Bienvenu, M., Lutz, C., Wolter, F.: Query containment in description logics reconsidered. In: Proceedings of the Thirteenth International Conference Principles of Knowledge Representation and Reasoning, KR 2012, 10–14 June 2012, Rome, Italy (2012)

    Google Scholar 

  8. Bienvenu, M., Lutz, C., Wolter, F.: First-order rewritability of atomic queries in horn description logics. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, 3–9 August 2013, Beijing, China (2013)

    Google Scholar 

  9. Calvanese, D., Carbotta, D., Ortiz, M.: A practical automata-based technique for reasoning in expressive description logics. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, 16–22 July 2011, Barcelona, Catalonia, Spain, pp. 798–804 (2011)

    Google Scholar 

  10. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. Artif. Intell. 195, 335–360 (2013)

    Article  MATH  Google Scholar 

  11. Calvanese, D., De Giacomo, G., Lenzerini, M.: Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 1999, July 31 - August 6, 1999, Stockholm, Sweden, vol 2, pp. 84–89 (1999). 1450 pages

    Google Scholar 

  12. Hladik, J., Sattler, U.: A translation of looping alternating automata into description logics. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 90–105. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Lutz, C., Seylan, I., Wolter, F.: An automata-theoretic approach to uniform interpolation and approximation in the description logic EL. In: Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning, KR 2012, 10–14 June 2012, Rome, Italy (2012)

    Google Scholar 

  14. Lutz, C., Wolter, F.: Foundations for uniform interpolation and forgetting in expressive description logics. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, 16–22 July 2011, Barcelona, Catalonia, Spain, pp. 989–995 (2011)

    Google Scholar 

  15. Wilke, T.: Alternating tree automata, parity games, and modal-calculus. Bull. Belg. Math. Soc. 8, 359–391 (2001)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Frank Wolter

Authors
  1. Frank Wolter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frank Wolter .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Czech Technical University, Prague, Czech Republic

    Jan Janoušek

  3. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus Liebig University Giessen, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Wolter, F. (2016). Automata for Ontologies. In: Dediu, AH., Janoušek, J., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2016. Lecture Notes in Computer Science(), vol 9618. Springer, Cham. https://doi.org/10.1007/978-3-319-30000-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30000-9_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29999-0

  • Online ISBN: 978-3-319-30000-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics