Journal: | Computación y sistemas |
Database: | PERIÓDICA |
System number: | 000408049 |
ISSN: | 1405-5546 |
Authors: | Muñoz, Juan Pablo1 Bárcenas, Everardo2 Martínez, Iván1 Arrazola, José Ramón Enrique1 |
Institutions: | 1Benemérita Universidad Autónoma de Puebla, Facultad de Ciencias Físico Matemáticas, Puebla. México 2Universidad Veracruzana, Jalapa, Veracruz. México |
Year: | 2016 |
Season: | Ene-Mar |
Volumen: | 20 |
Number: | 1 |
Pages: | 67-79 |
Country: | México |
Language: | Inglés |
Document type: | Artículo |
Approach: | Analítico, aplicado |
English 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 |
Disciplines: | Ciencias de la computación, Filosofía, Matemáticas |
Keyword: | Inteligencia artificial, Lógica, Matemáticas aplicadas, Semántica, Lenguaje, Lógica matemática, Representación del conocimiento, Razonamiento automatizado |
Keyword: | Computer science, Philosophy, Mathematics, Artificial intelligence, Logic, Applied mathematics, Knowledge representation, Language, Mathematical logic, Automated reasoning |
Full text: | Texto completo (Ver PDF) |