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

DOI10.1007/S10472-013-9365-7MaRDI QIDQ360253zbMATH OpenOpenAlexFDO

Authors Christopher Jefferson, Martin J. Green, M. R. C. van Dongen, P. 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

consistencyconstraint satisfactionGröbner basis

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)

Recommendations

• Constraint logic programming with polynomial constraints over finite domains
• A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form
• Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form
• Automated Reasoning
• A subdivision algorithm to reason on high-degree polynomial constraints over finite domains

Cites work

• scientific article; zbMATH DE number 3857249 (Why is no real title available?)
• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 177867 (Why is no real title available?)
• scientific article; zbMATH DE number 1256733 (Why is no real title available?)
• scientific article; zbMATH DE number 555223 (Why is no real title available?)
• scientific article; zbMATH DE number 638938 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• scientific article; zbMATH DE number 1420823 (Why is no real title available?)
• scientific article; zbMATH DE number 967945 (Why is no real title available?)
• A Variant of the Buchberger Algorithm for Integer Programming
• A new efficient algorithm for computing Gröbner bases (F₄)
• A sufficient condition for backtrack-bounded search
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• An optimal k-consistency algorithm
• Boolean Gröbner bases
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Bucket elimination: A unifying framework for reasoning
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• FGb: A Library for Computing Gröbner Bases
• Handbook of constraint programming.
• Implementing a test for tractability
• Local consistency and SAT-solvers
• Symbolic-interval cooperation in constraint programming
• Tractable constraints on ordered domains
• What can be computed in algebraic geometry?

Cited in

(7)

• Direct application of constraints to symmetric algebraic systems
• A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form
• Counting and enumerating feasible rotating schedules by means of Gröbner bases
• Ideal membership problem over 3-element CSPs with dual discriminator polymorphism
• Constraint logic programming with polynomial constraints over finite domains
• A subdivision algorithm to reason on high-degree polynomial constraints over finite domains
• Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form

Describes a project that uses

Uses Software

• MiniZinc
• FGb

This page was built for publication: Representing and solving finite-domain constraint problems using systems of polynomials

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