Representing and solving finite-domain constraint problems using systems of polynomials

DOI10.1007/s10472-013-9365-7zbMath1272.68327OpenAlexW2074949746MaRDI QIDQ360253

M. R. C. van Dongen, Christopher Jefferson, Martin J. Green, Peter G. Jeavons

Publication date: 26 August 2013

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:fcc2b14a-daf2-486d-a81b-c3a71f2d4e63

zbMATH Keywords

Gröbner basisconsistencyconstraint satisfaction

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Related Items

Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism, Counting and enumerating feasible rotating schedules by means of Gröbner bases

Uses Software

• FGb
• MiniZinc

Cites Work

• Boolean Gröbner bases
• An optimal k-consistency algorithm
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Implementing a test for tractability
• Bucket elimination: A unifying framework for reasoning
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Local Consistency and SAT-Solvers
• Symbolic-interval cooperation in constraint programming
• A Variant of the Buchberger Algorithm for Integer Programming
• A sufficient condition for backtrack-bounded search
• What can be computed in algebraic geometry?
• FGb: A Library for Computing Gröbner Bases
• Tractable constraints on ordered domains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item