Representing and solving finite-domain constraint problems using systems of polynomials
DOI10.1007/S10472-013-9365-7zbMATH Open1272.68327OpenAlexW2074949746MaRDI QIDQ360253FDOQ360253
P. Jeavons, M. R. C. van Dongen, Christopher Jefferson, Martin J. Green
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
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
consistency[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]constraint satisfaction
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)
Cites Work
- FGb: A Library for Computing Gröbner Bases
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local consistency and SAT-solvers
- Tractable constraints on ordered domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- What can be computed in algebraic geometry?
- A sufficient condition for backtrack-bounded search
- An optimal k-consistency algorithm
- Implementing a test for tractability
- Bucket elimination: A unifying framework for reasoning
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Symbolic-interval cooperation in constraint programming
- A Variant of the Buchberger Algorithm for Integer Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boolean Gröbner bases
Cited In (5)
- Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism
- 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
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form
Uses Software
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)
