A semantical model for integration and modularization of rules

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.