Abstract
This paper studies the complexity of the query answering problem in logic databases with complex values. Logic databases are represented as Horn clause logic programs; complex values are described in a data model based on equational theories. As examples of complex values, we consider trees, bags and finite sets. We give a natural sufficient condition under which the query answering problem for non-recursive programs with complex values is in NEXP. In particular, logic programs with trees, bags and finite sets satisfy this condition. We also show that the query answering problem for non-recursive range restricted logic programs is NEXP-hard. Thereby, the query answering problem for logic databases with trees, bags and sets turns out to be NEXP-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.
