Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form

DOI10.1007/s10472-017-9544-zzbMath1409.68268OpenAlexW2601071040WikidataQ59382263 ScholiaQ59382263MaRDI QIDQ2363599

Stefania Monica, Federico Bergenti

Publication date: 20 July 2017

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

Full work available at URL: https://doi.org/10.1007/s10472-017-9544-z

zbMATH Keywords

constraint satisfaction problemspolynomial constraints over finite domainshyper-arc consistencymodified Bernstein form

Mathematics Subject Classification ID

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

Related Items

A subdivision algorithm to reason on high-degree polynomial constraints over finite domains

Uses Software

• clpfd
• SWI-Prolog

Cites Work

• Global optimization with spline constraints: a new branch-and-bound method based on B-splines
• Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
• SAT modulo linear arithmetic for solving polynomial constraints
• The Bernstein polynomial basis: a centennial retrospective
• Algebraic manipulation in the Bernstein form made simple via convolutions
• Subdivision methods for solving polynomial equations
• An efficient algorithm for range computation of polynomials using the Bernstein form
• Algorithms for polynomials in Bernstein form
• SWI-Prolog
• Principles of Constraint Programming
• A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form