Presburger Büchi tree automata with applications to logics with expressive counting

DOI10.1007/978-3-031-15298-6_19OpenAlexW4297809211MaRDI QIDQ6160751FDOQ6160751

Authors: Bartosz Bednarczyk, Oskar Fiuk 

Publication date: 2 June 2023

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15298-6_19

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Carathéodory bounds for integer cones
• Elements of finite model theory.
• On the complexity of integer programming
• Automata can show PSpace results for description logics
• Counting in trees
• Automata for unordered trees
• Term Rewriting and Applications
• Small solutions of linear diophantine equations
• An Introduction to Description Logic
• On modal logics of linear inequalities
• Logics for unordered trees with data constraints
• A new description logic with set constraints and cardinality constraints on role successors
• Complexity of modal logics with Presburger constraints
• Answering regular path queries in expressive description logics via alternating tree-automata
• The Complexity of Enriched Mu-Calculi
• One-variable logic meets Presburger arithmetic

Cited In (2)

• On two-variable guarded fragment logic with expressive local Presburger constraints
• First steps towards taming description logics with strings

This page was built for publication: Presburger Büchi tree automata with applications to logics with expressive counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160751)