Modular lazy search for constraint satisfaction problems

DOI10.1017/S0956796801004051MaRDI QIDQ2757107zbMATH OpenFDO

Authors Thomas Nordin, Andrew Tolmach

Publication date 21 November 2001

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0956796801004051

zbMATH Keywords

combinatorial search problemslazy functional languages

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Search combinators
• Monadic constraint programming
• scientific article; zbMATH DE number 1234562
• scientific article; zbMATH DE number 1008453
• scientific article; zbMATH DE number 1497836

Cited in

(5)

• \textsc{Tor}: modular search with hookable disjunction
• Monadic constraint programming
• scientific article; zbMATH DE number 2084709 (Why is no real title available?)
• scientific article; zbMATH DE number 1497836 (Why is no real title available?)
• Fair constraint merging tableaux in lazy functional programming style

Describes a project that uses

Uses Software

• GraphBase

This page was built for publication: Modular lazy search for constraint satisfaction problems

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