Integration of functions in the fixpoint semantics of rule-based systems

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Lambrichts, E., Nees, P., Paredanes, J., Peelman, P., & Tanca, L. (1989). Integration of functions in the fixpoint semantics of rule-based systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 364 LNCS, pp. 301–316). Springer Verlag. https://doi.org/10.1007/3-540-51251-9_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free