Skip to main content
Log in

Formally Verified Tableau-Based Reasoners for a Description Logic

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Description Logics are a family of logics used to represent and reason about conceptual and terminological knowledge. One of the most basic description logics is \({\mathcal{ALC}}\), used as a basis from which to obtain others. Description logics are particularly important to provide a logical basis for the web ontology languages (such as OWL) used in the Semantic Web. In order to increase the reliability of the Semantic Web, formal methods can be applied, and in particular formal verification of its reasoning services can be carried out. In this paper, we present the formal verification of a tableau-based satisfiability algorithm for the logic \({\mathcal{ALC}}\). The verification has been completed in several stages. First, we develop an abstract formalization of satisfiability-checking of \({\mathcal{ALC}}\)-concepts. Secondly, we define and formally verify a tableau-based algorithm in which the order of rule application and branch selection can be flexibly specified, using a methodology of refinements to transfer the main properties from the \({\mathcal{ALC}}\) abstract formalization. Finally, we obtain verified and executable reasoners from the algorithm via a process of instantiation.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aczel, P.: An introduction to inductive definitions. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 739–782. North–Holland Publishing Company (1977)

  2. Alonso, J.A., Borrego, J., Hidalgo, M.J., Martín, F.J., Ruiz, J.L.: Verification of the formal concept analysis. RACSAM (Revista de la Real Academia de Ciencias), Serie A: Matemáticas 98, 3–16 (2004)

    MATH  Google Scholar 

  3. Alonso, J.A., Borrego, J., Hidalgo, M.J., Martín, F.J., Ruiz, J.L.: A formally verified prover for the ALC description logic. In: Theorem Proving in Higher Order Logics. Lecture Notes in Computer Science, vol. 4732, pp. 135–150. Springer (2007)

  4. Armand, M., Faure, G., Grégoire, B., Keller, C., Théry, L., Wener, B.: Verifying SAT and SMT in Coq for a fully automated decision. In: PSATTT’11: International Workshop on Proof-Search in Axiomatic Theories and Type Theories (2011)

  5. Baader, F., Hollunder, B.: A terminological knowledge representation system with complete inference algorithms. In: Proceedings of the First International Workshop on Processing Declarative Knowledge, pp. 67–86 (1991)

  6. Baader, F., McGuiness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press (2003)

  7. Boyer, R.S., Moore, J.S.: A Computational Logic. Academic Press (1979)

  8. Butler, R.W., Sjogren, J.: A PVS graph theory library. Technical report, NASA Langley (1998)

  9. Caldwell, J.L.: Classical propositional decidability via Nuprl proof extraction. In: Theorem Proving in Higer Order Logics. Lecture Notes in Computer Science, vol. 1479, pp. 105–122. Springer (1998)

  10. Caminati, M.B.: Basic first–order model theory in Mizar. J. Formalized Reasoning 3(1), 49–77 (2010)

    MATH  MathSciNet  Google Scholar 

  11. Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Commun. ACM 22(8), 465–476 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  12. Dold, A.: Formal software development using generic development steps. PhD thesis, Ulm University (2000)

  13. Haarslev, V., Möller, R.: RACER system description. In: International Joint Conference on Automated Reasoning, IJCAR’2001. Lecture Notes in Computer Science, vol. 2083, pp. 701–705. Springer (2001)

  14. Harrison, J.: Formalizing basic first order model theory. In: Theorem Proving in Higher Order Logics: 11th International Conference, TPHOLs’98. Lecture Notes in Computer Science, vol. 1497. Springer (1998)

  15. Hidalgo, M.J., Alonso, J.A., Martín, F.J., Ruiz, J.L.: Constructing formally verified reasoners for the description logic. In: Proceedings of the 3rd international workshop on automated specification and verification of web systems (WWV 2007). Electronic Notes in Theoretical Computer Science, vol. 200, pp. 87–102 (2008)

  16. Horrocks, I.: Implementation and optimization techniques. In: Baader, F., McGuiness, D., Nardi, D., Patel-Schneider, P. (eds.) The Description Logic Handbook: Theory, Implementation and Applications, pp. 306–346. Cambridge University Press (2003)

  17. Jones, C.B.: Systematic Software Development using VDM. Prentice–Hall International (1990)

  18. Marić, F.: Formalization and implementation of modern SAT solvers. J. Autom. Reasoning 43, 81–119 (2009)

    Article  MATH  Google Scholar 

  19. Martín, F.J., Alonso, J.A., Hidalgo, M.J., Ruiz, J.L.: Formal verification of a generic framework to synthesize SAT–provers. J. Autom. Reasoning 32(4), 287–313 (2004)

    Article  MATH  Google Scholar 

  20. Muñoz, C.: PVSio reference manual version 2.b. Technical report, National Institute of Aerospace (2005)

  21. Nutt, W.: Algorithms for Constraint in Deduction and Knowledge Representation. PhD thesis, Universität des Saarlandes, 1993.

  22. Owre, S., Rushby, J.M., Shankar, N.: PVS: a prototype verification system. In: 11th International Conference on Automated Deduction (CADE). Lecture Notes in Artificial Intelligence, vol. 607, pp. 748–752. Springer (1992)

  23. Owre, S., Shankar, N.: Abstract datatype in PVS. Technical report, Computer Science Laboratory, SRI International (1997)

  24. Owre, S., Shankar, N., Rushby, J.M., Stringer-Calvert, D.W.J.: PVS language reference. Technical report, Computer Science Laboratory, SRI International (1999)

  25. Rademaker, A.: A Proof Theory for Description Logics. Springer (2012)

  26. Ridge, T., Margetson, J.: A mechanically verified, sound and complete theorem prover for first order logic. In: Proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics. Lecture Notes in Computer Science, vol. 3603, pp. 249–309. Springer (2005)

  27. Shankar, N.: Towards mechanical metamathematics. J. Autom. Reasoning 1, 407–434 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  28. Shankar, N., Vaucher, M.: The mechanical verification of a DPLL-Based satisfiability solver. Electronic Notes in Theoretical Computer Science 269, 3–17 (2011)

    Article  MathSciNet  Google Scholar 

  29. Sirin, E., Parsia, B.: Pellet system description. In: Proceedings of the 2006 International Workshop on Description Logics (DL2004). CEUR Workshop Proceedings, vol. 189 (2006)

  30. Tobies, S.: Complexity results and practical algorithms for logics in knowledge representation. PhD thesis, RWTH–Aachen University (2001)

  31. Tsarkov, D., Horrocks, I.: FaCT+ + description logic reasoner: system description. In: Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2006). Lecture Notes in Artificial Intelligence, vol. 4130, pp. 292–297. Springer (2006)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. J. Hidalgo-Doblado.

Additional information

Partially supported by TIN2009-09492 Project of Ministerio de Ciencia e Innovación and Excellence Project TIC-06064 of Junta de Andalucía, co-financed with FEDER founds.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hidalgo-Doblado, M.J., Alonso-Jiménez, J.A., Borrego-Díaz, J. et al. Formally Verified Tableau-Based Reasoners for a Description Logic. J Autom Reasoning 52, 331–360 (2014). https://doi.org/10.1007/s10817-013-9291-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-013-9291-8

Keywords

Navigation