| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 424376 | Electronic Notes in Theoretical Computer Science | 2007 | 17 Pages |
Abstract
In a previous paper, we have showed that Hybrid Modal Logic can be successfully used to model semistructured data and provides a simple and well suited formalism for capturing “well typed” references and of course a powerful language for expressing constraint. This paper builds on the previous one and provides a tableau proof technique for constraint satisfiability testing in the presence of schemas.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
