Testing XML constraint satisfiability

Nicole Bidoit; Dario Colazzo

doi:10.1016/j.entcs.2006.11.025

Testing XML constraint satisfiability

Nicole Bidoit
, Dario Colazzo

Université Paris-Saclay

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

Résumé

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.

langue originale	Anglais
Pages (de - à)	45-61
Nombre de pages	17
journal	Electronic Notes in Theoretical Computer Science
Volume	174
Numéro de publication	6
Les DOIs	https://doi.org/10.1016/j.entcs.2006.11.025
état	Publié - 3 juin 2007
Modification externe	Oui

Accès au document

10.1016/j.entcs.2006.11.025

Contient cette citation

@article{c38bea20f7d14746ae04e29b333e0c9b,

title = "Testing XML constraint satisfiability",

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.",

keywords = "Database, Integrity constraints, Multimodal and Hybrid logic, Schema, Semistructured data",

author = "Nicole Bidoit and Dario Colazzo",

year = "2007",

month = jun,

day = "3",

doi = "10.1016/j.entcs.2006.11.025",

language = "English",

volume = "174",

pages = "45--61",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

number = "6",

}

TY - JOUR

T1 - Testing XML constraint satisfiability

AU - Bidoit, Nicole

AU - Colazzo, Dario

PY - 2007/6/3

Y1 - 2007/6/3

N2 - 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.

AB - 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.

KW - Database

KW - Integrity constraints

KW - Multimodal and Hybrid logic

KW - Schema

KW - Semistructured data

U2 - 10.1016/j.entcs.2006.11.025

DO - 10.1016/j.entcs.2006.11.025

M3 - Article

AN - SCOPUS:34249729330

SN - 1571-0661

VL - 174

SP - 45

EP - 61

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

IS - 6

ER -

Testing XML constraint satisfiability

Résumé

Accès au document

Empreinte digitale

Contient cette citation