Solving difference constraints over modular arithmetic

DOI10.1007/978-3-642-38574-2_15MaRDI QIDQ4928440zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Graeme Gange, Harald Søndergaard, Peter J. Stuckey, Peter Schachte

Publication date 14 June 2013

Published in Automated Deduction – CADE-24 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38574-2_15

Mathematics Subject Classification ID

Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Speeding up the constraint-based method in difference logic
• A Benders decomposition approach to deciding modular linear integer arithmetic
• On the Satisfiability of Modular Arithmetic Formulae
• Theory and Applications of Models of Computation
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems

Cited in

(5)

• A Benders decomposition approach to deciding modular linear integer arithmetic
• A layered algorithm for quantifier elimination from linear modular constraints
• Speeding up the constraint-based method in difference logic
• Programming Languages and Systems
• Theory and Applications of Models of Computation

Describes a project that uses

Uses Software

• Octagon

This page was built for publication: Solving difference constraints over modular arithmetic

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