Constraint Logic Programming with Polynomial Constraints over Finite Domains

DOI10.3233/FI-2018-1693zbMath1396.68030OpenAlexW2811364124MaRDI QIDQ4686512

Gianfranco Rossi, Federico Bergenti, Stefania Monica

Publication date: 2 October 2018

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2018-1693

zbMATH Keywords

constraint logic programmingpolynomial constraints over finite domainsmodified Bernstein form

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

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

Uses Software

• SWI-Prolog

This page was built for publication: Constraint Logic Programming with Polynomial Constraints over Finite Domains