Abstract
We discuss the integration of functions, types, complex objects and negation in a rule-based system, using the fixpoint semantics. This extension of Datalog is called MilAnt. The rules, the predicates and the functions are typed with complex objects. Functions can be defined to have a result of an arbitrary complex object type. MilAnt consistency is defined as a stronger form of consistency for functions and an algorithm is given to detect the MilAnt consistency in the non-recursive case. To this end, we use a mixture of dependencies that are local to a rule and dependencies that are global for the whole program.
This research is supported by the National Stimulation Program for Fundamental Research in Artifical Intelligence, fund no 131.194
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Abiteboul, S. and S. Grumbach; “COL: a logic-based language for complex objects”, Proc. European Conf. Extending Database Technology (EDBT88), Venice, 1988.
Abiteboul, S. and R. Hull; “Data functions, Datalog and negation”, Proc. of the ACMSIGMOD Conference, 1988.
Armstrong, W.W.; “Dependency structures of data base relationships”, Proc. 1974 IFIP Congress, North Holland, Amsterdam.
Bancilhon, F. and R. Ramakrishnan; “An amateur's introduction to recursive query processing”, Proc. of the ACM-SIGMOD Conference, May 1986.
Ceri, S. and L. Tanca; “Optimization of systems of algebraic equations for evaluating Datalog queries”, Proc. 13th Int. Conference on Very large Data Bases, Brighton, September 1987.
Ceri, S., G. Gottlob, and L. Tanca; “Logic Programming and Databases”, Springer-Verlag, 1989.
Gyssens, M., J. Paredaens, and D. Van Gucht; “A Uniform Approach towards Handling Atomic and Structured Information in the Nested Relational Database Model”, 1988, to appear in Journal of ACM.
Kolaitis, P.G. and C.H. Papadimitriou; “Why not negation by fixpoint?” in Proc. ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, Austin, Texas, 1988.
Kuper, G.M.; “On the expressive power of logic programming languages with sets” in Proc. ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, Austin, Texas, 1988.
Lambrichts, E., P. Nees, J. Paredaens, P. Peelman, and L. Tanca; “MilAnt: An Extension of Datalog with Complex Objects, Functions and Negation”, UIA Internal Report 88-34, Antwerp, 1988.
Minker, J. (ed.); Foundations of Deductive Databases and Logic Programming, Washington, 1986.
Przymusinski, T.; “On the semantics of a stratified deductive databases”, Workshop on Deductive Databases, Univ. of Maryland, August 1986.
Reiter, R.; “What should a database know?”, in Proc. ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, Austin, 1988.
Sacca, D. and C. Zaniolo; “Magic counting methods”, Proc. of the ACM-SIGMOD Conference, S. Francisco, May 1987.
Ullman, J.D., “Database and Knowledge-base Systems, Volume I”, Computer Science Press, 1988.
Vieille, L.; “Recursive axioms in deductive databases: the Query-Subquery approach”, Proc. First Int. Conf. on Expert Database Systems, L. Kerschberg ed., Charleston, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lambrichts, E., Nees, P., Paredanes, J., Peelman, P., Tanca, L. (1989). Integration of functions in the fixpoint semantics of rule-based systems. In: Demetrovics, J., Thalheim, B. (eds) MFDBS 89. MFDBS 1989. Lecture Notes in Computer Science, vol 364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51251-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-51251-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51251-6
Online ISBN: 978-3-540-46182-1
eBook Packages: Springer Book Archive