On the usefulness of linear modular arithmetic in constraint programming

DOI10.1007/978-3-030-78230-6_16OpenAlexW3170003207MaRDI QIDQ2117225

Gilles Pesant, Mahshid Mohammadalitajrishi, Kuldeep S. Meel

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

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

Related Items (2)

Practically uniform solution sampling in constraint programming ⋮ Solution sampling with random table constraints

Cites Work

• Unnamed Item
• Global constraint catalogue: past, present and future
• A dynamic programming approach for consistency and propagation for knapsack constraints
• Sharpening constraint programming approaches for bit-vector theory
• Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
• An Alternative to SAT-Based Approaches for Bit-Vectors
• The Complexity of Enumeration and Reliability Problems
• Sparse Hashing for Scalable Approximate Model Counting

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