Abstract
We present a transformation system for deductive database (DDB) modules. We show that it preserves several data dependency properties of a DDB and is correct for the “perfect model” semantics of DDBs. Perfect models are not directly amenable to logical reasoning since logically equivalent DDBs may have different perfect models. We develop an approach which involves using a condition on data dependencies in DDBs (stratification compatibility) to pass from a logical equivalence to equivalence under perfect model semantics. This is readily applicable to the transformation system.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. Apt & H. Blair, Arithmetic Classification of Perfect Models of Stratified Programs, Proc. ICLP/SLP-5, 765–779, 1988.
K. Apt, H. Blair & A. Walker, Towards a Theory of Declarative Knowledge, in: Foundations of Deductive Databases and Logic Programming, J. Minker (Ed), Morgan Kaufmann, 89–148, 1988.
A. Chandra & D. Harel, Horn Clause Queries and Generalizations, Journal of Logic Programming 1, 1–15, 1985.
K. Clark, Negation as Failure, in Logic and Databases, H. Gallaire & J. Minker (Eds), Plenum Press, 293–322, 1978.
A. van Gelder, Negation as Failure Using Tight Derivations for General Logic Programs, in: Foundations of Deductive Databases and Logic Programming, J. Minker (Ed), Morgan Kaufmann, 149–176, 1988.
J. Jaffar & J-L. Lassez, Constraint Logic Programming, Proc. POPL, 111–119, 1987.
K. Kunen, Signed Data Dependencies in Logic Programs, Journal of Logic Programming, to appear. Also CSTR 719, Computer Sciences Department, University of Wisconsin-Madison, 1987.
M. Maher, Equivalences of Logic Programs, in: Foundations of Deductive Databases and Logic Programming, J. Minker (Ed), Morgan-Kaufmann, 627–658, 1988.
M. Maher, Correctness of a Logic Program Transformation System, IBM Research Report, T. J. Watson Research Center, 1988.
M. Maher, A Transformation System for Deductive Database Modules with Perfect Model Semantics, IBM Research Report, T. J. Watson Research Center, 1989.
T. Przymusinski, On the Declarative Semantics of Deductive Databases and Logic Programs, in: Foundations of Deductive Databases and Logic Programming, J. Minker (Ed), Morgan Kaufmann, 193–216, 1988.
T. Sato, On Consistency of First Order Logic Programs, TR-87-12, Electrotechnical Laboratory, 1987.
H. Seki, Unfold/Fold Transformation of Stratified Programs, Proc. ICLP-6, 554–568, 1989.
H. Tamaki & T. Sato, Unfold/Fold Transformation of Logic Programs, Proc. ICLP-2, 127–138, 1984.
H. Tamaki & T. Sato, A Generalized Correctness Proof of the Unfold/Fold Logic Program Transformation, Information Science Technical Report 86–4, Ibaraki University, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maher, M.J. (1989). A transformation system for deductive database modules with perfect model semantics. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_35
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive