🚀 go-pugleaf

In article <1991Jun14.130850.13707@bohra.cpg.oz.au> als@bohra.cpg.oz.au (Anthony Shipman) writes:
>In article <5828@uniol.UUCP>, Jens.Rettig@arbi.informatik.uni-oldenburg.de (Jens Rettig) writes:
>> Generally , Prolog is capable of solving those kind of probelms
>> quite easily. You just have to think of a way of representing the
>> facts you have and the rules that have to be obeid. But it is a little
>I suspect that formulating such problems in Prolog is the lion's share of the
>problem.  The rest is just mechanical and can usually be done with pencil and
>paper quite easily.

Formulating the problems so they can be solved efficiently can be a little
tricky. In any case, there are a set of standard techniques.  Some extensions
of LP languages, e.g. constraint logic programming langs, do almost all of the
work for you. 

I'm sure both of the above posters would agree that the big win is that LP
and CLP languages can solve problems with search spaces bigger than feasible
for humans, i.e. problems found outside of puzzle books.

David Hawley
-- 
Location: 4th-lab, ICOT, 1-4-28 Mita, Minato-ku Tokyo 108 JAPAN.
EMail: hawley@icot.or.jp, hawley@icot.jp@relay.cs.net,
       uucp:{enea,inria,kddlab,mit-eddie,ukc}!icot!hawley