License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2016.32
URN: urn:nbn:de:0030-drops-65720
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6572/
Go to the corresponding LIPIcs Volume Portal

Baelde, David ; Lunel, Simon ; Schmitz, Sylvain

A Sequent Calculus for a Modal Logic on Finite Data Trees

pdf-format:
LIPIcs-CSL-2016-32.pdf (0.5 MB)

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.

BibTeX - Entry

@InProceedings{baelde_et_al:LIPIcs:2016:6572,
  author =	{David Baelde and Simon Lunel and Sylvain Schmitz},
  title =	{{A Sequent Calculus for a Modal Logic on Finite Data Trees}},
  booktitle =	{25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
  pages =	{32:1--32:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-022-4},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{62},
  editor =	{Jean-Marc Talbot and Laurent Regnier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6572},
  URN =		{urn:nbn:de:0030-drops-65720},
  doi =		{10.4230/LIPIcs.CSL.2016.32},
  annote =	{Keywords: XPath, proof systems, modal logic, complexity}
}

Keywords: XPath, proof systems, modal logic, complexity
Collection: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Issue Date: 2016
Date of publication: 29.08.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI