(Hyper)sequent Calculi for the ALC(S4) Description Logics
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 reas...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2016 |
| País: | México |
| Institución: | Benemérita Universidad Autónoma de Puebla |
| Repositorio: | Redalyc-BUAP |
| OAI Identifier: | oai:redalyc.org:61544821007 |
| Acceso en línea: | https://www.redalyc.org/articulo.oa?id=61544821007 |
| Access Level: | acceso abierto |
| Palabra clave: | Computación proof theory (Hyper)sequents Description logics automated reasoning |
| Sumario: | 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. |
|---|