Optimizing query evaluation in deductive databases using reductions

We show how it is possible to exploit reduction theory of high level Petri net theory, for query optimization in deductive databases. For this we first present a model derived from high level Petri nets, called Deductive Coloured Petri Net (DCPN), which allows an efficient implementation of deductive database management systems. Thus, we give conditions of applying high level Petri net reduction techniques, and adapt them to the DCPN model. Finally, we illustrate through an example, the benefits of such reductions on the query evaluation in deductive databases.