Abstract
We study the issue of providing intelligent answers to recursive queries. We first extend the notion of intelligent answers by allowing them to be incomplete. Complete and incomplete intelligent answers are both useful in that they provide (possibly partial) characterizations of queries for users to understand. Complete intelligent answers also allows us to compute the queries more efficiently. We propose a general approach that enables us to combine several cases studied previously for constructing intelligent answers, Moreover, in our approach, semantic constraints can be systematically utilized to provide complete intelligent answers to a wider range of queries. We consider two commonly used classes of semantic constraints called implication and referential constraints, and show that the completeness of intelligent answers with respect to semantic constraints can be reduced to the semantics-based query containment problem. >
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.
