DL-SR: a Lite DL with Expressive Rules: Preliminary Results

Jean-François Baget 1, 2 Michel Leclère 2 Marie-Laure Mugnier 2 Eric Salvat 3
2 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Simple conceptual graphs can be seen as a very basic description logic, allowing however for answering conjunctive queries. In the first part of this paper, we translate some results obtained for conceptual graph rules of form ``if A then B'' into an equivalent DL-based formalism. Then we show that, our algorithms can automatically decide in some cases whether a given DL has the FOL-reducibility property, provided that the semantics of its constructors can be expressed by rules.
Type de document :
Communication dans un congrès
DL'2008: 21st International Workshop on Description Logics, Dresden, Allemagne, CEUR-WS.org, pp.11, 2008, 〈http://dl.kr.org/dl2008/〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00394383
Contributeur : Marie-Laure Mugnier <>
Soumis le : jeudi 11 juin 2009 - 14:54:58
Dernière modification le : jeudi 24 mai 2018 - 15:59:22

Identifiants

  • HAL Id : lirmm-00394383, version 1

Citation

Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, Eric Salvat. DL-SR: a Lite DL with Expressive Rules: Preliminary Results. DL'2008: 21st International Workshop on Description Logics, Dresden, Allemagne, CEUR-WS.org, pp.11, 2008, 〈http://dl.kr.org/dl2008/〉. 〈lirmm-00394383〉

Partager

Métriques

Consultations de la notice

369