Testing XML constraint satisfiability | Zendy

Nicole Bidoít | Zendy; Dario Colazzo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Testing XML constraint satisfiability

Author(s) -

Nicole Bidoít,

Dario Colazzo

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2006.11.025

Subject(s) - satisfiability , computer science , programming language , formalism (music) , constraint (computer aided design) , theoretical computer science , xml , modal , modal logic , algorithm , mathematics , art , musical , chemistry , geometry , polymer chemistry , visual arts , operating system

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research