Monadic decomposition in integer linear arithmetic

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

Authors: Matthew Hague, Philipp Rümmer, Zhilin Wu, 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Monadic decomposition
• The power of symbolic automata and transducers
• String solving with word equations and transducers: towards a logic for analysing mutation XSS
• Decision problems among the main subfamilies of rational relations
• Title not available (Why is that?)
• Variable independence for first-order definable constraints
• Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
• Word equations in nondeterministic linear space
• On solving word equations using SAT
• The taming of the semi-linear set
• Subclasses of Presburger arithmetic and the weak EXP hierarchy

Cited In (2)

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

Uses Software

• S3

This page was built for publication: Monadic decomposition in integer linear arithmetic

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