Complexity of Two-Variable Logic on Finite Trees
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 74-88
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Verification of Two-Variable Logic Revisited2012
- Two-variable logic on data trees and XML reasoningJournal of the ACM, 2009
- XPath leashedACM Computing Surveys, 2009
- XPath satisfiability in the presence of DTDsJournal of the ACM, 2008
- Results on the Guarded Fragment with Equivalence or Transitive Relations2005
- XPath with Conditional Axis RelationsLecture Notes in Computer Science, 2004
- First-Order Logic with Two Variables and Unary Temporal LogicInformation and Computation, 2002
- EXPSPACE-Complete Variant of Guarded Fragment with Transitivity2002
- Modal Languages and Bounded Fragments of Predicate LogicJournal of Philosophical Logic, 1998
- On the Decision Problem for Two-Variable First-Order LogicThe Bulletin of Symbolic Logic, 1997