On the usefulness of linear modular arithmetic in constraint programming

DOI10.1007/978-3-030-78230-6_16MaRDI QIDQ2117225zbMATH OpenOpenAlexFDO

Authors Gilles Pesant, Kuldeep S. Meel, Mahshid Mohammadalitajrishi

Publication date 21 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-78230-6_16

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites work

• A dynamic programming approach for consistency and propagation for knapsack constraints
• An alternative to SAT-based approaches for bit-vectors
• Global constraint catalogue: past, present and future
• Model counting: a new stategy for obtaining good bounds
• Sharpening constraint programming approaches for bit-vector theory
• Sparse Hashing for Scalable Approximate Model Counting
• The Complexity of Enumeration and Reliability Problems
• Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling

Cited in

(4)

• Solution sampling with random table constraints
• Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic
• Practically uniform solution sampling in constraint programming
• Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions

This page was built for publication: On the usefulness of linear modular arithmetic in constraint programming

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