<< Back to previous view

[LOGIC-87] Decomplect the narrowing of the constraint space from the search order Created: 27/Dec/12  Updated: 28/Dec/12

Status: Open
Project: core.logic
Component/s: None
Affects Version/s: None
Fix Version/s: None

Type: Enhancement Priority: Minor
Reporter: Jamie Brandon Assignee: David Nolen
Resolution: Unresolved Votes: 0
Labels: None

Attachments: Text File flexible_search.patch    
Patch: Code and Test


From a high-level point of view a constraint solver takes a constraint space, generates a tree of narrowings of the space and runs some search algorithm on the tree. Core.logic complects the generation of this tree and the search algorithm by representing the search space as a lazy stream of the leaves of the tree. By explicitly representing the search tree we get new search algorithms, optional fair conjunction and parallel search via fork-join.

More detail: http://scattered-thoughts.net/blog/2012/12/19/search-trees-and-core-dot-logic/

Github fork: https://github.com/clojure/core.logic/pull/13

Attached is a cleaned-up patch against d68e3400472c5f745e4c13d64433459e11ba4871

Comment by David Nolen [ 28/Dec/12 12:41 AM ]

Thanks! Will try to find some time this weekend to do a thorough review.

Generated at Wed Jan 16 22:41:06 CST 2019 using JIRA 4.4#649-r158309.