A refutation procedure for proving satisfiability of constraint specifications on XML documents

15 pages•Published: December 4, 2014

Abstract

In this paper we first present three sorts of constraints (positive, negative and conditional ones) to specify that certain patterns must be satisfied in a XML document. These constraints are built on boolean XPath patterns. We define a specification as a set of clauses whose literals are constraints.
Then, to reason about these specifications, we study some sound rules which permit to infer, subsume or simplify clauses. The main goal is to design a refutation procedure (based on these rules) to test if a given specification is satisfiable or not. We have formally proven the soundness of our procedure and we study the completeness and termination of the proposed method.

Keyphrases: constraint, refutation procedure, xml document, xpath pattern

In: Temur Kutsia and Andrei Voronkov (editors). SCSS 2014. 6th International Symposium on Symbolic Computation in Software Science, vol 30, pages 47-61.

Links:	https://easychair.org/publications/paper/zMn
	https://doi.org/10.29007/jfwc

BibTeX entry

@inproceedings{SCSS2014:refutation_procedure_proving_satisfiability,
  author    = {Marisa Navarro and Fernando Orejas},
  title     = {A refutation procedure for proving satisfiability of constraint specifications on XML documents},
  booktitle = {SCSS 2014. 6th International Symposium on Symbolic Computation in Software Science},
  editor    = {Temur Kutsia and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {30},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/zMn},
  doi       = {10.29007/jfwc},
  pages     = {47-61},
  year      = {2014}}

Download PDF Open PDF in browser