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.

[1]  Moshe Y. Vardi,et al.  The Hybrid mu-Calculus , 2001 .

[2]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[3]  Mordechai Ben-Ari,et al.  Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness , 1982, J. Comput. Syst. Sci..

[4]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[5]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[6]  Rohit Parikh.  Propositional logics of programs: systems, models, and complexity , 1980, POPL '80.

[7]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

[8]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[9]  George Gargov,et al.  Determinism and Looping in Combinatory PDL , 1988, Theor. Comput. Sci..

[10]  Serge Abiteboul,et al.  Querying Semi-Structured Data , 1997, Encyclopedia of Database Systems.

[11]  T. G. Szymanski,et al.  On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages , 1976, J. Comput. Syst. Sci..

[12]  Wenfei Fan,et al.  Path constraints on semistructured and structured data , 1998, PODS '98.

[13]  Dan Suciu,et al.  Adding Structure to Unstructured Data , 1997, ICDT.

[14]  Edith Hemaspaandra.  The Complexity of Poor Man's Logic , 2001, J. Log. Comput..

[15]  Tinko Tinchev,et al.  An Essay in Combinatory Dynamic Logic , 1991, Inf. Comput..

[16]  Jeffrey D. Ullman,et al.  Representative objects: concise representations of semistructured, hierarchical data , 1997, Proceedings 13th International Conference on Data Engineering.

[17]  Neil Immerman,et al.  Model Checking and Transitive-Closure Logic , 1997, CAV.

[18]  Dan Suciu,et al.  A query language and optimization techniques for unstructured data , 1996, SIGMOD '96.

[19]  Wenfei Fan,et al.  Path Constraints on Deterministic Graphs , 1998 .

[20]  Alberto O. Mendelzon,et al.  Querying the World Wide Web , 1997, International Journal on Digital Libraries.

[21]  I-Peng Lin,et al.  The Complexity of Propositional Modal Theories and the Complexity of Consistency of Propositional Modal Theories , 1994, LFCS.

[22]  William C. Rounds,et al.  Feature Logics , 1997, Handbook of Logic and Language.

[23]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[24]  Johan van Benthem,et al.  Back and Forth Between Modal Logic and Classical Logic , 1995, Log. J. IGPL.

[25]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[26]  Serge Abiteboul,et al.  Regular path queries with constraints , 1997, J. Comput. Syst. Sci..

[27]  Maarten Marx,et al.  A Road-Map on Complexity for Hybrid Logics , 1999, CSL.

[28]  Dan Suciu,et al.  Query Decomposition and View Maintenance for Query Languages for Unstructured Data , 1996, VLDB.

[29]  Patrick Blackburn,et al.  Hybrid languages , 1995, J. Log. Lang. Inf..

[30]  Francesco M. Donini,et al.  Reasoning in description logics , 1997 .

[31]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[32]  Joseph Y. Halpern.  The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic , 1995, Artif. Intell..

[33]  J W Ballard,et al.  Data on the web? , 1995, Science.

[34]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[35]  Edith Hemaspaandra,et al.  The Price of Universality , 1996, Notre Dame J. Formal Log..

[36]  Roy Goldman,et al.  DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases , 1997, VLDB.

[37]  Jennifer Widom,et al.  The Lorel query language for semistructured data , 1997, International Journal on Digital Libraries.