A modal perspective on path constraints
| Authors |
|
|---|---|
| Publication date | 2003 |
| Journal | Journal of Logic and Computation |
| Volume | Issue number | 13 | 6 |
| Pages (from-to) | 939-956 |
| Organisations |
|
| 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. |
| Document type | Article |
| Language | English |
| Published at | https://doi.org/10.1093/logcom/13.6.939 |
| Downloads |
jlc02.pdf
(Submitted manuscript)
|
| Permalink to this page | |
