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

DOI10.1007/S10472-019-09680-4zbMATH Open1474.68323OpenAlexW2992719104WikidataQ126629263 ScholiaQ126629263MaRDI QIDQ2294575FDOQ2294575

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

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

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)

Cites Work

• SWI-Prolog
• The Bernstein polynomial basis: a centennial retrospective
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for polynomials in Bernstein form
• Principles of 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
• Subdivision methods for solving polynomial equations
• An efficient algorithm for range computation of polynomials using the Bernstein form
• Algebraic manipulation in the Bernstein form made simple via convolutions
• Bounds on a polynomial
• On the Multivariate Horner Scheme
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Embarrassingly Parallel Search in Constraint Programming
• Matrix methods for the tensorial 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
• A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form

Cited In (1)

• A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form

Uses Software

• clpfd
• SWI-Prolog

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)