Path Constraints from a Modal Logic Point of View

We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding them in Propositional Dynamic Logic. While some of our decidability results were known before, we believe that our improved complexity bounds are new. Our proofs, based on techniques from modal logic, shed additional light on the reasons for previously known decidability and complexity results.

• Type: Conference
• Year: 2001
• Where: KRDB
• Authors: Natasha Alechina, Stéphane Demri, Maarten de Rijke
• Keywords: Database, Improved Complexity Bounds, KRDB 2001, Path Constraints, Propositional Dynamic Logic