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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00394383
Contributor : Marie-Laure Mugnier <>
Submitted on : Saturday, June 29, 2019 - 8:19:01 PM
Last modification on : Sunday, June 30, 2019 - 4:05:46 PM

File

BagetLeclereMugnierSalvat.pdf
Files produced by the author(s)

Identifiers

  • 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: Description Logics, May 2008, Dresden, Germany. ⟨lirmm-00394383⟩

Share

Metrics

Record views

650

Files downloads

5