DL-SR: a Lite DL with Expressive Rules: Preliminary Results - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2008

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

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.
Fichier principal
Vignette du fichier
BagetLeclereMugnierSalvat.pdf (334.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00394383 , version 1 (29-06-2019)

Identifiers

  • HAL Id : lirmm-00394383 , version 1

Cite

Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, Eric Salvat. DL-SR: a Lite DL with Expressive Rules: Preliminary Results. DL: Description Logics, May 2008, Dresden, Germany. ⟨lirmm-00394383⟩
317 View
17 Download

Share

Gmail Facebook X LinkedIn More