论文信息 - Approximate Subsumption in ALCQ

Approximate Subsumption in ALCQ

We present a non-standard interpretation for concept expressions in ALCQ that defines approximate notions of subsumption based on approximating a subset of the concept and role names. We present the non-standard semantics, and the corresponding notion of approximate subsumption, discuss its formal properties and show that is can be computed by syntactic manipulations of concept expressions.

Heiner Stuckenschmidt

[1] Thomas Lukasiewicz,et al. P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web , 2002, JELIA.

[2] Marco Schaerf,et al. Approximation in Concept Description Languages , 1992, KR.

[3] Marco Schaerf,et al. Tractable Reasoning via Approximation , 1995, Artif. Intell..

[4] Heiner Stuckenschmidt,et al. Approximating Description Logic Classification for Semantic Web Reasoning , 2005, ESWC.

[5] Umberto Straccia,et al. Towards a Fuzzy Description Logic for the Semantic Web (Preliminary Report) , 2005, ESWC.

[6] Francesco M. Donini,et al. A system for principled matchmaking in an electronic marketplace , 2003, WWW '03.