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

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!