On the Satisfiability of Modular Arithmetic Formulae

DOI10.1007/11901914_16zbMATH Open1161.68496OpenAlexW1581189074MaRDI QIDQ3522909FDOQ3522909

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

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

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)

Cited In (3)

• Title not available (Why is that?)
• Programming Languages and Systems
• Upper bounds for the size and the depth of formulae for MOD-functions

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)