We consider in this paper an extension of Datalog with mechanisms for temporal, nonmonotonic and nondeterministic reasoning, which we refer to as Datalog++. We study its semantics, and show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their efficient execution. On this basis, the design of appropriate optimization techniques for Datalog++ is also discussed.
CITATION STYLE
Giannotti, F., Manco, G., Nanni, M., & Pedreschi, D. (1999). On the effective semantics of nondeterministic, nonmonotonic, temporal logic databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1584, pp. 58–72). Springer Verlag. https://doi.org/10.1007/10703163_5
Mendeley helps you to discover research relevant for your work.