On Armstrong-compliant Logical Query Languages

Marie Agier 1 Christine Froidevaux 2, 3 Jean-Marc Petit 4 Yoan Renaud 4 Jef Wijsen
3 AMIB - Algorithms and Models for Integrative Biology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
4 BD - Base de Données
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : We present a simple logical query language called RL for expressing diff erent kinds of rules and we study how this language behaves with respect to the well-known Armstrong's axioms. We point out some negative results, e.g. it is undecidable to know whether or not a query from this language is \Armstrong compliant". The main contribution of this paper is to exhibit a restricted form of RL-queries - yet with a good expressive power - for which Armstrong's axioms are sound. From this result, this sublanguage turns out to have structural and computational properties which have been shown to be very useful in data mining, databases and formal concept analysis.
Liste complète des métadonnées

https://hal.inria.fr/hal-00649604
Contributor : Christine Froidevaux <>
Submitted on : Thursday, December 8, 2011 - 11:46:57 AM
Last modification on : Wednesday, April 3, 2019 - 1:03:27 AM

Identifiers

  • HAL Id : hal-00649604, version 1

Citation

Marie Agier, Christine Froidevaux, Jean-Marc Petit, Yoan Renaud, Jef Wijsen. On Armstrong-compliant Logical Query Languages. 4th International Workshop on Logic in Databases, (EDBT/ICDT '10 joint conference), George H. L. Fletcher and Slawek Staworko, 2011, Uppsala, Sweden. pp.33-40. ⟨hal-00649604⟩

Share

Metrics

Record views

735