Conflict resolution of rules assigning values to virtual attributes

In the majority of research work done on logic programming and deductive databases, it is assumed that the set of rules defined by the user is consistent, i.e., that no contradictory facts can be inferred by the rules. In this paper, we address the problem of resolving conflicts of rules that assign...

Full description

Saved in:
Bibliographic Details
Main Authors: Ioannidis, Yannis E., Sellis, Timos K.
Format: Conference Proceeding
Language:English
Subjects:
Computing methodologies > Artificial intelligence > Knowledge representation and reasoning > Logic programming and answer set programming
Information systems > Data management systems
Information systems > Data management systems > Query languages
Theory of computation > Logic > Constraint and logic programming
Theory of computation > Theory and algorithms for application domains > Database theory > Database query languages (principles)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the majority of research work done on logic programming and deductive databases, it is assumed that the set of rules defined by the user is consistent, i.e., that no contradictory facts can be inferred by the rules. In this paper, we address the problem of resolving conflicts of rules that assign values to virtual attributes. We devise a general framework for the study of the problem, and we propose an approach that subsumes all previously suggested solutions. Moreover, it suggests several additional solutions, which very often capture the semantics of the data more accurately than the known approaches. Finally, we address the issue of how to index rules so that conflicts are resolved efficiently, i.e., only one of the applicable rules is processed at query time.
ISSN:0163-5808
DOI:10.1145/67544.66945