Work

A Sequent Calculus for a Modal Logic on Finite Data Trees

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.
Language: English
Open Access status: green
OpenAlex ID: W2535950331
FWCI: 1.788
Cites: 21
Cited by: 18
Related to: 9