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

DOI10.1007/S10472-019-09680-4MaRDI QIDQ2294575zbMATH OpenOpenAlexWikidataFDO

Authors Federico Bergenti, Stefania Monica

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

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

Recommendations

• 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
• Constraint logic programming with polynomial constraints over finite domains
• Representing and solving finite-domain constraint problems using systems of polynomials
• Subdivision methods for solving polynomial equations

Cites work

• scientific article; zbMATH DE number 1639656 (Why is no real title available?)
• scientific article; zbMATH DE number 3965308 (Why is no real title available?)
• scientific article; zbMATH DE number 1149429 (Why is no real title available?)
• scientific article; zbMATH DE number 3080734 (Why is no real title available?)
• A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form
• Algebraic manipulation in the Bernstein form made simple via convolutions
• Algorithms for polynomials in Bernstein form
• An efficient algorithm for range computation of polynomials using the Bernstein form
• Bounds on a polynomial
• Constraint logic programming with polynomial constraints over finite domains
• Embarrassingly parallel search in constraint programming
• Fast construction of constant bound functions for sparse polynomials
• Global optimization with spline constraints: a new branch-and-bound method based on B-splines
• Handbook of constraint programming.
• Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form
• Matrix methods for the tensorial Bernstein form
• On the Multivariate Horner Scheme
• Principles of Constraint Programming
• SWI-Prolog
• Subdivision methods for solving polynomial equations
• The Bernstein polynomial basis: a centennial retrospective

Cited in

(2)

• A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form
• Representing and solving finite-domain constraint problems using systems of polynomials

Describes a project that uses

Uses Software

• SWI-Prolog
• clpfd

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

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