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

DOI10.1007/s10472-019-09680-4zbMath1474.68323OpenAlexW2992719104WikidataQ126629263 ScholiaQ126629263MaRDI QIDQ2294575

Stefania Monica, Federico Bergenti

Publication date: 11 February 2020

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

Full work available at URL: https://doi.org/10.1007/s10472-019-09680-4

zbMATH Keywords

constraint satisfaction problemshigh-degree polynomial constraintspolynomial constraints over finite domains

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• clpfd
• SWI-Prolog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global optimization with spline constraints: a new branch-and-bound method based on B-splines
• The Bernstein polynomial basis: a centennial retrospective
• Algebraic manipulation in the Bernstein form made simple via convolutions
• Subdivision methods for solving polynomial equations
• Fast construction of constant bound functions for sparse polynomials
• An efficient algorithm for range computation of polynomials using the Bernstein form
• Algorithms for polynomials in Bernstein form
• Matrix methods for the tensorial Bernstein form
• Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form
• SWI-Prolog
• Embarrassingly Parallel Search in Constraint Programming
• Principles of Constraint Programming
• On the Multivariate Horner Scheme
• 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
• Bounds on a polynomial

This page was built for publication: A subdivision algorithm to reason on high-degree polynomial constraints over finite domains