Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.11889/4456
Title: | Ordered Model Trees: a Normal Form for Disjunctive Deductive Databases. | Authors: | Yahya, Adnan Fernandez, Jose Alberto Minker, Jack |
Keywords: | Deductive database;Disjunctive database;Digital preservation;Metadata - Management;Ordered model trees | Issue Date: | 1993 | Publisher: | Springer Verlag | Source: | Yahya, A., Fernández, J.A. & Minker, J. J Autom Reasoning (1994) 13: 117. doi:10.1007/BF00881914 | Abstract: | Model trees were conceived as a structure-sharing approach to represent information in disjunctive deductive databases. In this paper we introduce the concept ofordered minimal model trees as a normal form for disjunctive deductive databases. These are model trees in which an order is imposed on the elements of the Herbrand base. The properties of ordered minimal model trees are investigated as well as their possible utilization for efficient manipulation of disjunctive deductive databases. Algorithms are presented for constructing and performing operations on ordered model trees. The complexity of ordered model tree processing is addressed. Model forests are presented as an approach to reduce the complexity of ordered model tree construction and processing. | URI: | http://hdl.handle.net/20.500.11889/4456 | ISSN: | doi:10.1007/BF00881914 |
Appears in Collections: | Fulltext Publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
AbstractOrderedModelTrees.pdf | 179.74 kB | Adobe PDF | View/Open |
Page view(s)
123
Last Week
3
3
Last month
5
5
checked on Apr 14, 2024
Download(s)
19
checked on Apr 14, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.