On the Satisfiability of Modular Arithmetic Formulae

DOI10.1007/11901914_16MaRDI QIDQ3522909zbMATH OpenOpenAlexFDO

Authors Bow-Yaw Wang

Publication date 4 September 2008

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11901914_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Integer programming (90C10) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Satisfiability modulo linear arithmetic over a finite ring
• A survey of satisfiability modulo theory
• Programming Languages and Systems
• scientific article; zbMATH DE number 1979549
• A Benders decomposition approach to deciding modular linear integer arithmetic

Cited in

(6)

• scientific article; zbMATH DE number 7561747 (Why is no real title available?)
• Satisfiability modulo linear arithmetic over a finite ring
• A Benders decomposition approach to deciding modular linear integer arithmetic
• Upper bounds for the size and the depth of formulae for MOD-functions
• Solving difference constraints over modular arithmetic
• Programming Languages and Systems

Describes a project that uses

Uses Software

• SLAM
• SYMPHONY

This page was built for publication: On the Satisfiability of Modular Arithmetic Formulae

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