Abstract
A higher-order query language of Horn-clause programs without function symbols, also known as Datalog, has received considerable attention recently. One way to optimize Datalog programs is to transform a Datalog program into a equivalent one that can be evaluated more efficiently. Therefore, determining equivalence of Datalog programs, especially between a given recursive program and a given nonrecursive one, is a fundamental problem. We introduce a new approach to prove the decidability of this equivalence problem, by enumerating databases and using some other simple known results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
