Constraint logic programming with polynomial constraints over finite domains

DOI10.3233/FI-2018-1693MaRDI QIDQ4686512zbMATH OpenOpenAlexFDO

Authors Federico Bergenti, Stefania Monica, Gianfranco Rossi

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 programmingmodified Bernstein formpolynomial constraints over finite domains

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Compiling constraints in clp(FD)
• 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
• Reasoning on constraints in CLP(FD)
• Computer Algebra in Scientific Computing

Cited in

(11)

• A subdivision algorithm to reason on high-degree polynomial constraints over finite domains
• scientific article; zbMATH DE number 1615255 (Why is no real title available?)
• Compiling constraints in clp(FD)
• Representing and solving finite-domain constraint problems using systems of polynomials
• scientific article; zbMATH DE number 1234565 (Why is no real title available?)
• Reasoning on constraints in CLP(FD)
• scientific article; zbMATH DE number 2080049 (Why is no real title available?)
• scientific article; zbMATH DE number 2090033 (Why is no real title available?)
• Path consistency in clp(FD)
• Computer Algebra in Scientific Computing
• CAL: A theoretical background of constraint logic programming and its applications

Describes a project that uses

Uses Software

• SWI-Prolog

This page was built for publication: Constraint logic programming with polynomial constraints over finite domains

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