Exploiting constraints for domain managing in CLP(FD)

DOI10.1007/3-540-45988-X_14MaRDI QIDQ4737133zbMATH OpenFDO

Authors Marco Gavanelli, Evelina Lamma, Paola Mello, Michela Milano

Publication date 11 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/2309/23090177.htm

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Reasoning on constraints in CLP(FD)
• Compiling constraints in clp(FD)
• Constraint functional logic programming over finite domains
• Constraint satisfaction using constraint logic programming
• A comparative study of eight constraint programming languages over the Boolean and finite domains

Cited in

(2)

• Reasoning on constraints in CLP(FD)
• scientific article; zbMATH DE number 2090549 (Why is no real title available?)

This page was built for publication: Exploiting constraints for domain managing in CLP(FD)

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