An effect of simplifying magic rules for answering recursive queries in deductive databases

An effect of simplifying magic rules for answering recursive queries in deductive databases

The basic magic sets transformation algorithm for rewriting logical rules in deductive databases is very clear and straightforward. However, rules generated by the algorithm for answering queries are too many compared to the original rules. Therefore, it is useful to simplify the generated rules bef...

Full description

Bibliographic Details
Main Authors: Mamat, Ali, Mat Deris, Mustafa
Format: Article
Language:English
Published: Faculty of Computer Science and Information Technology, University of Malaya 1997
Online Access:http://psasir.upm.edu.my/id/eprint/49444/
http://psasir.upm.edu.my/id/eprint/49444/1/An%20effect%20of%20simplifying%20magic%20rules%20for%20answering%20recursive%20queries%20in%20deductive%20databases.pdf

Similar Items

Similar Items