A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form
From MaRDI portal
Publication:5215368
DOI10.1007/978-3-319-49130-1_14zbMath1430.68287WikidataQ59382276 ScholiaQ59382276MaRDI QIDQ5215368
Federico Bergenti, Gianfranco Rossi, Stefania Monica
Publication date: 10 February 2020
Published in: AI*IA 2016 Advances in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-49130-1_14
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68N17: Logic programming
Related Items
A subdivision algorithm to reason on high-degree polynomial constraints over finite domains, Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form