Testing XML constraint satisfiability

Authors:
Nicole Bidoit;Dario Colazzo
Affiliations:
Univ Paris Sud, UMR CNRS 8623, Orsay F-91405, CNRS, Orsay F 91405;Univ Paris Sud, UMR CNRS 8623, Orsay F-91405, CNRS, Orsay F 91405
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 9
Cited 4

Automated deduction in nonclassical logics

Automated deduction in nonclassical logics
Integrity constraints for XML

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Combining deduction and model checking into Tableaux and algorithms for converse-PDL

Information and Computation
Tableaux for Quantified Hybrid Logic

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
XPath satisfiability in the presence of DTDs

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Two-variable logic on data trees and XML reasoning

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Satisfiability of XPath queries with sibling axes

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Consistency of XML specifications

Inconsistency Tolerance
On the complexity of hybrid logics with binders

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Incorporating constraints in probabilistic XML

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incorporating constraints in probabilistic XML

ACM Transactions on Database Systems (TODS)
Types and constraints: from relational to XML data

SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
Attribute grammar for XML integrity constraint validation

DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.