Abstract
Several classes of path constraints for semistructured data are analysed and a number of decidability and complexity results proved for such constraints. While some of these decidability results were known before, it is believed that the improved complexity bounds are new. Proofs are based on techniques from modal logic and automata theory. This modal logic perspective sheds additional light on the reasons for previously known decidability and complexity results.
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.
