Abstract
We consider logic programs without function symbols, called Datalog programs, and study their parallel complexity. We survey the tools developed for proving that there is a PRAM algorithm which computes the minimum model of a Datalog program in polylogarithmic parallel time using a polynomial number of processors (that is, for proving membership in NC ). We extend certain of these tools to be applied to a wider class of programs; as they were, they were applied to chain rule programs (i.e., the relations on the right-hand side of the rule are binary and form a chain). We examine the parallel complexity of weak-chain rule programs (i.e., the relations on the right-hand side of the rule form a weak chain), and prove certain subclasses to belong to NC . Finally we prove a wide class of programs to be log space complete for P , by giving sufficient conditions for a single rule program to be P -complete
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.
