Satisfying a Fragment of XQuery by Branching-Time Reduction

Satisfying a Fragment of XQuery by Branching-Time Reduction

Configuration logic (CL) is a fragment of XQuery that allows first-order quantification over node labels. In this paper, we study CL satisfiability and seek a deterministic decision procedure to build models of satisfiable CL formula. To this end, we show how to revert CL satisfiability into an equi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Halle, S., Villemaire, R.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Boolean functions
Councils
CTL
Data security
Information security
Logic
Navigation
Page description languages
Query processing
satisfiability
temporal logic
tree logic
XML
XQuery
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Configuration logic (CL) is a fragment of XQuery that allows first-order quantification over node labels. In this paper, we study CL satisfiability and seek a deterministic decision procedure to build models of satisfiable CL formula. To this end, we show how to revert CL satisfiability into an equivalent CTL satisfiability problem in order to leverage existing model construction algorithms for CTL formulae.
ISSN:1530-1311
2332-6468
DOI:10.1109/TIME.2008.20