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

DOI10.1007/978-3-031-15298-6_19MaRDI QIDQ6160751zbMATH OpenOpenAlexFDO

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)

Recommendations

• Automata, Languages and Programming
• Counting in trees
• The effects of bounding syntactic resources on Presburger LTL
• Register automata with extrema constraints, and an application to two-variable logic
• Register Automata with Extrema Constraints, and an Application to Two-Variable Logic

Cites work

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

Cited in

(7)

• Register automata with extrema constraints, and an application to two-variable logic
• Register Automata with Extrema Constraints, and an Application to Two-Variable Logic
• First steps towards taming description logics with strings
• On two-variable guarded fragment logic with expressive local Presburger constraints
• Axiomatization of modal logic with counting
• Constraint automata on infinite data trees: from \(\mathrm{CTL}(\mathbb{Z})/\mathrm{CTL}^*(\mathbb{Z})\) to decision procedures
• Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures

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)