harr (02/14/83)
I am interested in what experiences other people have had in representing state space (i.e. problem reduction paradigm) problems in Prolog. I have been trying to develop a general methodology for such implementations. Most importantly, what restrictions do you put on the state representation, the operator rules, and the enumerated types. Also, how do you then incorporate different sets of heuristics cleanly. The result of a state space implementation should be 'clean' By clean I mean the execution semantics of the heuristics and operators should be straightforward and modular. Any comments?