scientific article
From MaRDI portal
Publication:3086934
zbMath1226.03049MaRDI QIDQ3086934
Thomas Schwentick, Helmut Seidl, Anca Muscholl
Publication date: 30 March 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
XMLcomputational complexitymonadic second-order logicdecidabilitytree automatatree languagesqueriesfixpoint logicunranked treesPresburger logicPresburger arithmetics
Database theory (68P15) Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
Complexity of modal logics with Presburger constraints ⋮ Reasoning with Global Assumptions in Arithmetic Modal Logics ⋮ Logics for unordered trees with data constraints ⋮ Presburger Büchi tree automata with applications to logics with expressive counting ⋮ Schemas for unordered XML on a DIME ⋮ Verifying quantitative temporal properties of procedural programs ⋮ On regular paths with counting and data tests ⋮ Automata for unordered trees
This page was built for publication:
