EnglishThis chapter shows the subsumption computation techniques for a LOGIDATA+ schema allowing cyclic definitions for classes. The formal framework LOGIDATA_CYC*, which extends LOGIDATA* to perform taxonomic reasoning in the presence of cyclic class definitions is introduced. It includes the notions of possible instances of a schema; legal instance of a schema, defined as the greatest fixed-point of possible instances; subsumption relation. On the basis of this framework, the definitions of coherent type and consistent class are introduced and the necessary algorithms to detect incoherence and compute subsumption in a LOGIDATA+ schema are given. Some examples of subsumption computation show its feasibility for schema design and validation.
Taxonomic Reasoning with Cycles in LOGIDATA+ / Beneventano, Domenico; Bergamaschi, Sonia; Sartori, C.. - STAMPA. - 701(1993), pp. 105-128.
| Data di pubblicazione: | 1993 |
| Titolo: | Taxonomic Reasoning with Cycles in LOGIDATA+ |
| Autore/i: | Beneventano, Domenico; Bergamaschi, Sonia; Sartori, C. |
| Autore/i UNIMORE: | |
| Titolo del libro: | LOGIDATA+: Deductive Databases with Complex Objects |
| ISBN: | 9783540569749 |
| Editore: | SPRINGER |
| Nazione editore: | GERMANIA |
| Citazione: | Taxonomic Reasoning with Cycles in LOGIDATA+ / Beneventano, Domenico; Bergamaschi, Sonia; Sartori, C.. - STAMPA. - 701(1993), pp. 105-128. |
| Tipologia | Capitolo/Saggio |
File in questo prodotto:
I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
Copyright © 2021