Monadic decomposition in integer linear arithmetic

DOI10.1007/978-3-030-51074-9_8OpenAlexW3038336498MaRDI QIDQ2096441

Philipp Rümmer, Zhilin Wu, Matthew Hague, Anthony Widjaja Lin

Publication date: 9 November 2022

Full work available at URL: https://arxiv.org/abs/2004.12371

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

Learning union of integer hypercubes with queries (with applications to monadic decomposition), Quantifier elimination for counting extensions of Presburger arithmetic

Uses Software

• S3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The power of symbolic automata and transducers
• On solving word equations using SAT
• String solving with word equations and transducers: towards a logic for analysing mutation XSS
• Decision problems among the main subfamilies of rational relations
• The taming of the semi-linear set
• Subclasses of presburger arithmetic and the weak EXP hierarchy
• Monadic Decomposition
• Variable independence for first-order definable constraints
• Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility