Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Deductive and Object-Oriented Databases |
| Untertitel | 3rd International Conference, DOOD 1993, Proceedings |
| Herausgeber/-innen | Stefano Ceri, Katsumi Tanaka, Shalom Tsur |
| Herausgeber (Verlag) | Springer Verlag |
| Seiten | 253-266 |
| Seitenumfang | 14 |
| ISBN (Print) | 9783540575306 |
| Publikationsstatus | Veröffentlicht - 1993 |
| Veranstaltung | 3rd International Conference on Deductive and Object-Oriented Databases, DOOD 1993 - Phoenix, USA / Vereinigte Staaten Dauer: 6 Dez. 1993 → 8 Dez. 1993 |
Publikationsreihe
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Band | 760 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (elektronisch) | 1611-3349 |
Abstract
We propose a query-evaluation algorithm for database specifications consisting of overridable rules (defaults) and non-overridable rules (axioms). Both kinds of rules may contain disjunctions. Preferences among the defaults are given by a partial order which corresponds to a subclass relationship allowing multiple inheritance. We use a bottom-up theorem proving procedure. It is applied to the set of (disjunctively) assumed default instances which essentially can again be computed by bottom-up evaluation. Our approach has two main advantages: First, it gives a simple foundation for bottom-up evaluation in the presence of defaults; this can be taken as a basis for different optimizations. Second, in contrast to other deduction algorithms, it is able to handle pattially ordered defaults with a skeptical / minimal model semantics.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Theoretische Informatik
- Informatik (insg.)
- Allgemeine Computerwissenschaft
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Deductive and Object-Oriented Databases : 3rd International Conference, DOOD 1993, Proceedings. Hrsg. / Stefano Ceri; Katsumi Tanaka; Shalom Tsur. Springer Verlag, 1993. S. 253-266 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 760 LNCS).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Bottom-Up Query Evaluation with Partially Ordered Defaults
AU - Brass, Stefan
AU - Lipeck, Udo W.
N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1993.
PY - 1993
Y1 - 1993
N2 - We propose a query-evaluation algorithm for database specifications consisting of overridable rules (defaults) and non-overridable rules (axioms). Both kinds of rules may contain disjunctions. Preferences among the defaults are given by a partial order which corresponds to a subclass relationship allowing multiple inheritance. We use a bottom-up theorem proving procedure. It is applied to the set of (disjunctively) assumed default instances which essentially can again be computed by bottom-up evaluation. Our approach has two main advantages: First, it gives a simple foundation for bottom-up evaluation in the presence of defaults; this can be taken as a basis for different optimizations. Second, in contrast to other deduction algorithms, it is able to handle pattially ordered defaults with a skeptical / minimal model semantics.
AB - We propose a query-evaluation algorithm for database specifications consisting of overridable rules (defaults) and non-overridable rules (axioms). Both kinds of rules may contain disjunctions. Preferences among the defaults are given by a partial order which corresponds to a subclass relationship allowing multiple inheritance. We use a bottom-up theorem proving procedure. It is applied to the set of (disjunctively) assumed default instances which essentially can again be computed by bottom-up evaluation. Our approach has two main advantages: First, it gives a simple foundation for bottom-up evaluation in the presence of defaults; this can be taken as a basis for different optimizations. Second, in contrast to other deduction algorithms, it is able to handle pattially ordered defaults with a skeptical / minimal model semantics.
UR - http://www.scopus.com/inward/record.url?scp=0006496592&partnerID=8YFLogxK
U2 - 10.1007/3-540-57530-8_16
DO - 10.1007/3-540-57530-8_16
M3 - Conference contribution
AN - SCOPUS:0006496592
SN - 9783540575306
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 253
EP - 266
BT - Deductive and Object-Oriented Databases
A2 - Ceri, Stefano
A2 - Tanaka, Katsumi
A2 - Tsur, Shalom
PB - Springer Verlag
T2 - 3rd International Conference on Deductive and Object-Oriented Databases, DOOD 1993
Y2 - 6 December 1993 through 8 December 1993
ER -