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)

1 Edelweiss - Exchanges, Documents, Extraction, Languages, Web, Ergonomics, Interactions, Semantics, Servers
2 GRAPHIK - Graphs for Inferences on Knowledge
3 LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier

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.

Keywords: Rules; Description Logics; Conceptual graphs

Domains: Artificial Intelligence [cs.AI]

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⟩