Constructing Formally Verified Reasoners for the ALC Description Logic

Authors:
M. J. Hidalgo;J. A. Alonso;F. J. Martín;J. L. Ruiz
Affiliations:
Department of Computer Sciencs, University of Seville, Sevilla, Spain;Department of Computer Sciencs, University of Seville, Sevilla, Spain;Department of Computer Sciencs, University of Seville, Sevilla, Spain;Department of Computer Sciencs, University of Seville, Sevilla, Spain
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 7
Cited 1

Systematic software development using VDM (2nd ed.)

Systematic software development using VDM (2nd ed.)
A Terminological Knowledge Representation System with Complete Inference Algorithms

PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
RACER System Description

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
A formally verified prover for the ALC description logic

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
FaCT++ description logic reasoner: system description

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Formally Verified Tableau-Based Reasoners for a Description Logic

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Description Logics are a family of logics used to represent and reason about conceptual and terminological knowledge. Recently, its importance has been increased since they are used as a basis for the Ontology Web Language (OWL) used for the Semantic Web. In previous work, we have developed in PVS a generic framework for reasoning in the ALC description logic, proving its termination, soundness and completeness. In this paper we present the construction, from the generic framework, of a formally verified generic tableau-based algorithm for checking satisfiability of ALC-concepts. We do it using a methodology of refinements to transfer the properties from the framework to the algorithm. We also obtain some verified reasoners from the algorithm by a process of instantiation.