Package: lang/lisp/code/csp/ Name: Summary: Prosser's hybrid algorithms for the Constraint Satisfaction Problem Version:

kneewastefulAI and Robotics

Oct 29, 2013 (3 years and 8 months ago)

138 views

Package: lang/lisp/code/csp/


Name:


Summary: Prosser's hybrid algorithms for the Constraint


Satisfaction Problem


Version:


Description:



This directory contains Patrick Prosser's hybrid algorithms for the


bin
ary constraint satisfaction problem. Search algorithms include


chronological backtracking, backmarking, backjumping, forward


checking, graph
-
based backjumping, conflict
-
directed backjumping,


backjumping with directed 2
-
consistency, forward checki
ng with


directed 2
-
consistency, conflict directed backjumping with directed


k
-
consistency, forward checking with conflict
-
directed backjumping,


with directed k
-
consistency, and various combinations.


Requires:


Ports: SCLisp 4.0 (devel
oped using the Symbolic Programming


Environment, SPE 1.2)


Origin: ftp.daimi.aau.dk:pub/CLP/Prosserpackage.tar.Z


Copying:


Updated:


CD
-
ROM: Prime Time Freeware for AI, Issue 1
-
1


Bug Reports:


Mailing List:


Autho
r(s): Patrick Prosser <pat@cs.strath.ac.uk>


Contact:


Keywords:



Lisp!Code, CSP, Constraint Satisfaction, Authors!Prosser,


Forward Checking, Backtracking, Backmarking, Backjumping


Contains: ???


See Also:


References:



Th
e algorithms are described in the following papers:



[1] P. Prosser "Hybrid algorithms for the constraint satisfaction


problem", to appear in Computational Intelligence 9(3),


Autumn 1993 (previously technical report AISL
-
46
-
91)



[2] P. Prosser "BM+BJ=BMJ" Proc CAIA
-
93, 257
-
262



[3] P. Prosser "Domain filtering can degrade intelligent


backjumping search" to appear in Proc IJCAI
-
93



[4] P. Prosser "Forward checking with backmarking" Technical


Re
port AISL
-
48
-
93, Dept CS, Univ Strathclyde, Scotland