(Hyper)sequent Calculi for the ALC(S4) Description Logics

Authors

  • Juan Pablo Muñoz Benemérita Universidad Autónoma de Puebla
  • Everardo Bárcenas CONCyT - Universidad Veracruzana
  • Iván Martínez Benemérita Universidad Autónoma de Puebla
  • José Ramón Enrique Arrazola Benemérita Universidad Autónoma de Puebla

DOI:

https://doi.org/10.13053/cys-20-1-2186

Keywords:

Description logics, (Hyper)sequents, proof theory, automated reasoning.

Abstract

Description logics (DL) form a well-known family of knowledge representation languages. One of its main applications is on the Semantic Web as a reasoning framework in the form of the Ontology Web Language (OWL). In this paper, we propose a cut-free tree hypersequent calculus for terminological reasoning in the Description Logic ALC. We show the calculus is sound and complete. Also, an implementation is provided together with a complexity analysis. In addition, we also describe a cut-free sequent calculus for the description logic ALC with reflexive and transitive roles. Soundness and completeness are proven, and a complexity analysis and an implementation are also provided.

Author Biographies

Juan Pablo Muñoz, Benemérita Universidad Autónoma de Puebla

is a doctoral student in Mathematical Sciences at the Benemérita Universidad Autónoma de Puebla and also he is a grant holder by the Consejo Nacional de Ciencia y Tecnología (CONACYT). His main research areas are non-classical logic, proof theories, automated theorem proving, and knowledge representation.

Everardo Bárcenas, CONCyT - Universidad Veracruzana

is a researcher at the Consejo Nacional de Ciencia y Tecnología (CONACYT). He graduated from Université de Grenoble. His research interests include automated reasoning, modal logics, knowledge representation, and formal methods.

Iván Martínez, Benemérita Universidad Autónoma de Puebla

is a full-time professor of the Facultad de Ciencias Físico-Matemáticas at BUAP. He obtained his Ph.D. in Mathematical Sciences from the National Autonomus University of Mexico (UNAM) in 2010. His research interests are mathematical logic, set theory, logic programming, knowledge representation, and general topology.

José Ramón Enrique Arrazola, Benemérita Universidad Autónoma de Puebla

received his Bachelor’s, Master’s and Doctorate degrees from Benemérita Universidad Autónoma de Puebla in Puebla, Mexico, in 1986, 1989 and 1996, respectively. He has directed over 13 undergraduate theses, nine Master’s theses, and one doctoral thesis. Also, he has around 70 articles published. His research interests are mathematical logic, logic programming and knowledge representation, argumentation theory and topology. He is the current Director of the Physical-Mathematical Sciences Faculty at the Benemérita Universidad Autónoma de Puebla.

Downloads

Published

2016-03-31