A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in $\cal EL$ w.r.t. Hybrid TBoxes

DOI10.1007/978-3-540-87803-2_26zbMath1178.68567OpenAlexW1606259269MaRDI QIDQ3532475

Novak Novaković

Publication date: 27 October 2008

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87803-2_26

zbMATH Keywords

description logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (1)

A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in $\cal EL$ w.r.t. Hybrid TBoxes

Cites Work

• A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in $\cal EL$ w.r.t. Hybrid TBoxes
• KI 2005: Advances in Artificial Intelligence
• Conceptual Structures for Knowledge Creation and Communication

This page was built for publication: A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in $\cal EL$ w.r.t. Hybrid TBoxes