Path Constraints from a Modal Logic Point of View (Extended Abstract) (2001)
Cached
Download Links
| Venue: | In 8th International Workshop on Knowledge Representation meets Databases (KRDB-2001 |
| Citations: | 8 - 4 self |
BibTeX
@INPROCEEDINGS{Alechina01pathconstraints,
author = {Natasha Alechina and Stéphane Demri and Maarten De Rijke},
title = {Path Constraints from a Modal Logic Point of View (Extended Abstract)},
booktitle = {In 8th International Workshop on Knowledge Representation meets Databases (KRDB-2001},
year = {2001}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We analyze several classes of path constraints for semistructured data in a uni- ed 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.
