STACS 2005
From MaRDI portal
Publication:5710721
DOI10.1007/b106485zbMath1118.03313OpenAlexW4230940848MaRDI QIDQ5710721
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Undecidability and degrees of sets of sentences (03D35) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (4)
Two-Variable Logic with Counting and Trees ⋮ The two‐variable fragment with counting and equivalence ⋮ Data-complexity of the two-variable fragment with counting quantifiers ⋮ Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies
This page was built for publication: STACS 2005
