A Tableaux-based Method for Computing Least Common Subsumers for Expressive Description Logics

proc. of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), page 739--745 - July 2009
Download the publication : IJCAI09-128.pdf [538Ko]  
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.

BibTex references


@InProceedings{DCDD09,
author = {Francesco M. Donini and Simona Colucci and Tommaso {Di Noia} and Eugenio {Di Sciascio}},
title = "A Tableaux-based Method for Computing Least Common
Subsumers for Expressive Description Logics",
booktitle = "proc. of the Twenty-First International Joint
Conference on Artificial Intelligence (IJCAI-09)",
pages = "739--745",
month = "July",
year = "2009",
publisher = "AAAI",
url = "http://sisinflab.poliba.it/publications/2009/DCDD0
9"
}

Other publications in the database

SisInf Lab - Information Systems Laboratory

Research group of Politecnico di Bari
Edoardo Orabona St, 4 Bari, Italy