A Step Up in Expressiveness of Decidable Fixpoint Logics
From MaRDI portal
Publication:4635946
DOI10.1145/2933575.2933592zbMath1394.03014OpenAlexW2530320023MaRDI QIDQ4635946
Pierre Bourhis, Michael Vanden Boom, Michael Benedikt
Publication date: 23 April 2018
Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01413890/file/LICS16-gnfpup-long.pdf
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (5)
Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Evaluating Datalog via tree automata and cycluits ⋮ Guarded Ontology-Mediated Queries
This page was built for publication: A Step Up in Expressiveness of Decidable Fixpoint Logics