Abstract
We have presented the outlines of a system which integrates three rather distinct modern technologies for intelligent systems which share the property of having a relational model, but which otherwise have very little in common. Due to lack of space I cannot include a convincing example which will show that the RL language will be a convenient tool for expressing real life rules, but my experience is positive. Also the modularization feature turned out to be useful in the examples tried.
The real question is whether an RL system as described in this paper can be implemented. Given the fact that partial combinations of the elements of RL have been implemented I am positive on this issue. An integration of tabular rules and clauses is exactly the theme of the compiled approach discussed in section 3.2 which we know to be feasible on a sufficiently powerful database [VV86]. We also know how to deal with arithmetic equations and inequalities in isolation. Hence some combination of an equation solver and a powerful database seems to be an answer. The example of EQLOG [GM85] shows that a combination of clauses and abstract datatypes is feasible. Aggregates have not been implemented at the proposed level of generality but most database systems provide for the more common types by means of ad hoc features.
Preview
Unable to display preview. Download preview PDF.
References
Chang, C.L., DEDUCE 2: Further investigations of Deduction in Relational Databases, in [GM78].
Clocksin, E.F. & C.S. Mellish, Programming in Prolog, Springer 1981.
de Bakker, J.W., Mathematical Theory of Program correctness, Prentice Hall, 1980.
de Brock, E.O., Database Models and Retrieval Languages, PhD Thesis Technical University Eindhoven, Mrt 1984.
Gallaire, H.V. & J. Minker, eds., Logic and Databases, Plenum, New York 1978.
Gallaire, H.V., J. Minker & J-M. Nicolas, Logic and Databases: a Deductive Approach, Computing Surveys 16 (1985) 153–185.
Goguen, J.A. & J. Messeguer, Equality, Types, Modules, and (why not) Generics for Logic Programming, J. Logic Programming 1 (1985) 179–210.
Imielinski, T. & W. Lipski, jr., The Relational Model of Data and Cylindric Algebras, J. Comput. Syst. Sci. 28 (1984) 80–102.
Lucas, P., On the Structure of Application Programs, in D. Bjørner, ed., Abstract Software Specifications, Proc. Copenhagen Winterschool 1979, Springer LCS 86 (1980) 390–438.
Lucas, P., On the Versatility of Knowledge Representations, in E.J. Neuholt & G. Chroust, eds., The Role of Abstract models in Information Processing, Proc IFIP Working Conference, Vienna Jan 1985, North Holland Publ. Cie. 1985.
Manna, Z., Mathematical Theory of Computation, Computer Science Series, McGraw-Hill, New York 1974.
Naqvi, S.A. & L.J. Henschen, On Compiling Queries in Recursive First-Order Databases, J. ACM 31 (1984) 47–85.
Reiter, R., Deductive Question-Answering on Relational Databases, in [GM78].
Ullman, J.D., Principles of Database Systems, 2nd ed. Computer Science Press, Rockville MD 1982.
Ullman, J.D., Implementation of Logical Query Languages for Databases, ACM Trans. Database Systems, 10 (1985) 289–321.
van Emde Boas, P., RL, a Language for Enhanced Rule Bases Database Processing, Working Document, Rep RJ 4869 (51299), Oct 1986.
van Emde Boas, H. & P. van Emde Boas, Storing and Evaluating Horn-Clause Rules in a Relational Database, IBM J. Res. Develop. 30 (1986) 80–92.
van Wijngaarden, A. ea., Revised Report on the Algorithmic Language ALGOL68, Acta Informatica 5 (1975) 1–236.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Emde Boas, P. (1986). A semantical model for integration and modularization of rules. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016235
Download citation
DOI: https://doi.org/10.1007/BFb0016235
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive