Querying Datalog with Arrays: Design and Implementation Issues

This paper deals with the implementation of logic queries where array structures are manipulated. Both top-down and bottom-up implementations of the presented logic language, called DatalogA, are considered. Indeed, SLD-resolution is generalized to realize DatalogA top-down query answering. Further, a fixpoint based evaluation of DatalogA queries is introduced, which forms the basis for efficient bottom-up implementation of queries obtained by generalizing rewriting techniques such as magic set method to the case of DatalogA programs.