Solving the multiplication constraint in several approximation spaces

DOI10.1007/3-540-45635-X_1MaRDI QIDQ4736492zbMATH OpenFDO

Authors Alain Colmerauer

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2237/22370001.htm

zbMATH Keywords

constraint logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Approximate quantified constraint solving by cylindrical box decomposition
• scientific article; zbMATH DE number 683340
• New formulae for multiplication of intervals
• Optimal multiplication of \(G\)-intervals
• scientific article; zbMATH DE number 1059305

Cited in

(2)

• Local consistency for extended CSPs
• Multiplicative Parameterization Above a Guarantee

This page was built for publication: Solving the multiplication constraint in several approximation spaces

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