A tableaux-based method for computing least common subsumers for expressive description logics

Authors:
Francesco M. Donini;Simona Colucci;Tommaso Di Noia;Eugenio Di Sciascio
Affiliations:
Università della Tuscia, Viterbo, Italy;Politecnico di Bari, Italy;Politecnico di Bari, Italy;Politecnico di Bari, Italy
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

Citing 7
Cited 5

Unification of concept terms in description logics

Journal of Symbolic Computation
Computing Least Common Subsumers in Description Logics with Existential Restrictions

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions

KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
On the Problem of Computing Small Representations of Least Common Subsumers

KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
On automating Web services discovery

The VLDB Journal — The International Journal on Very Large Data Bases
The Description Logic Handbook

The Description Logic Handbook
Finding informative commonalities in concept collections

Proceedings of the 17th ACM conference on Information and knowledge management

Tableau-based Forgetting in ALC Ontologies

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A Unified Framework for Non-standard Reasoning Services in Description Logics

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Reasoning and explanation in EL and in expressive description logics

ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
Automating competence management through non-standard reasoning

Engineering Applications of Artificial Intelligence
Introductions to description logics: a guided tour

RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access

Quantified Score

Hi-index	0.00

Visualization

Abstract

Least Common Subsumers (LCS) have been proposed in Description Logics (DL) to capture the commonalities between two or more concepts. Since its introduction in 1992, LCS have been successfully employed as a logical tool for a variety of applications, spanning from inductive learning, to bottom-up construction of knowledge bases, information retrieval, to name a few. The best known algorithm for computing LCS uses structural comparison on normal forms, and the most expressive DL it is applied to is ALEN. We provide a general tableau-based calculus for computing LCS, via substitutions on concept terms containing concept variables. We show the applicability of our method to an expressive DL (but without disjunction and full negation), discuss complexity issues, and show the generality of our proposal.