Abstract
LDL is one of the recently proposed logical query languages, which incorporate set, for data and knowledge base systems. Since LDL programs can simulate negation, they are not monotonic in general. On the other hand, there are monotonic LDL programs. This paper addresses the natural question of “When are LDL programs monotonic?” and investigates related topics such as useful applications for monotonicity.
We examine two kinds of monotonicity. The first, called “ω-monotonicity,” is shown to be undecidable even when limited to single-stratum programs. The second, called “uniform monotonicity,” is shown to imply ω-monotonicity. We characterize the uniform monotonicity of a program (i) by a relationship between its Bancilhon-Khoshafian semantics and its LDL semantics, and (ii) with a useful property called subset completion independence. Characterization (ii) implies that uniformly monotonic programs can be evaluated more efficiently by discarding dominated facts. Finally, we provide some necessary and/or sufficient, syntactic conditions for uniform monotonicity. These conditions pinpoint (a) enumerated set terms, (b) negations of membership and inclusion, and (c) sharing of set terms as the main sources for nonuniform-monotonicity.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Extended Abstract
Supported in part by the NSF under grant CCR-86-18907.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul and S. Grumbach. COL: A language for complex objects based on recursive rules. In Proc. Int's Workshop on Theory and Applications of Nested Relations and Complex Objects, 1987.
S. Abiteboul and S. Grumbach. COL: A logic-based language for complex objects. In Advances in Database Technology — EDBT, LNCS, 1988.
F. Bancilhon and S. Khoshafian. A calculus for complex objects. JCSS, 38(2):326–340, 1989.
C. Beeri, S. Naqvi, R. Ramakrishnan, O. Shmueli, and S. Tsur. Sets and negation in a logic database language (LDL1). In Proc. PODS, pages 21–37, 1987.
R. Hull and J. Su. Untyped sets, inventions, and computable queries, In Proc. PODS, pages 347–359, 1989.
G. M. Kuper. Logic programming with sets. In Proc. PODS, pages 11–20, 1987.
G. M. Kuper. On the expressive power of logic programming languages with sets. In Proc. PODS, pages 10–14, 1988.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.
S. Naqvi and S. Tsur. A Logical Language for Data and Knowledge Bases. Computer Science Press, New York, 1989.
O. Shmueli, S. Tsur, and C. Zaniolo. Rewriting of rules containing set terms in a logic data language (LDL). In Proc. PODS, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dong, G. (1991). On the monotonicity of (LDL) logic programs with set. In: Thalheim, B., Demetrovics, J., Gerhardt, H.D. (eds) MFDBS 91. MFDBS 1991. Lecture Notes in Computer Science, vol 495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54009-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-54009-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54009-0
Online ISBN: 978-3-540-47348-0
eBook Packages: Springer Book Archive