CMU Artificial Intelligence Repository
Home INFO Search FAQs Repository Root

SATISFY: Simple program to solve satisfiability.

SATISFY is a simple program to solve satisfiability. It uses a continuation passing style to implement a backtracking search. No attempt is made to make the search go fast other than using shared variables.
Copying: Copyright (c) 1990 by Ted Dunning. Use and modification permitted, provided the copyright notice is retained intact and Dunning's contribution is acknowledged. CD-ROM: Prime Time Freeware for AI, Issue 1-1 Author(s): Ted Dunning Keywords: Authors!Dunning, Math, Satisfiability, Scheme!Code, Scheme!Math References: ?
Last Web update on Mon Feb 13 10:36:46 1995