Year: 2016
Type: article
Abstract: We investigate the proof theory of a modal fragment of XPath equipped with data (in)equality tests over finite data trees, i.e., over finite unranked trees where nodes are labelled with both a symbol from a finite alphabet and a single data value from an infinite domain. We present a sound and complete sequent calculus for this logic, which yields the optimal PSPACE complexity bound for its validity problem.
Parent work: LIPIcs, Volume 62, CSL'16, Complete Volume
Authors: Baelde, David, Lunel, Simon, Schmitz, Sylvain
Institution: Laboratoire Spécification et Vérification
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Agence Nationale de la Recherche
OpenAlex ID: W2535950331
