Logique de requêtes à la XPath : systèmes de preuve et pertinence pratique

Abstract : Motivated by applications ranging from XML processing to runtime verificationof programs, many logics on data trees and data streams have been developed in the literature.These offer different trade-offs between expressiveness and computationalcomplexity; their satisfiability problem has often non-elementary complexity or is even undecidable.Moreover, their study through model-theoretic or automata-theoretic approaches can be computationally impractical or lacking modularity.In a first part, we investigate the use of proof systems as a modular way tosolve the satisfiability problem of data logics on linear structures.For each logic we consider, we develop a sound and complete hypersequentcalculus and describe an optimal proof search strategy yielding an NPdecision procedure.In particular, we exhibit an NP-complete fragment of the tense logic over data ordinals---the full logic being undecidable---, which is exactly as expressive as the two-variable fragment of the first-order logic on data ordinals.In a second part, we run an empirical study of the main decidable XPath-likelogics proposed in the literature.We present a benchmark we developed to that end, and examine how these logicscould be extended to capture more real-world queries without impacting thecomplexity of their satisfiability problem.Finally, we discuss the results we gathered from our benchmark, and identifywhich new features should be supported in order to increase the practicalcoverage of these logics.
Document type :
Complete list of metadatas

Cited literature [135 references]  Display  Hide  Download

Contributor : Abes Star <>
Submitted on : Monday, September 2, 2019 - 3:49:05 PM
Last modification on : Friday, September 13, 2019 - 8:18:44 AM


Version validated by the jury (STAR)


  • HAL Id : tel-02276423, version 1


Anthony Lick. Logique de requêtes à la XPath : systèmes de preuve et pertinence pratique. Logique en informatique [cs.LO]. Université Paris-Saclay, 2019. Français. ⟨NNT : 2019SACLN016⟩. ⟨tel-02276423⟩



Record views


Files downloads