engleski

The Mathematics of Set Predicates in Prolog

We provide logical specification of set predicates findall, bagof of Prolog. The specification is in proof-theoretic terms, and pertains to any SLD-resolution based language. The order dependant aspects, relevant for languages ambodying a sequential proof search strategy (posibly with side effects), cann be added in an orthogonal way. The specification allows us to prove that bagof cannot be defined in terms of SLD-resolution alone. We show the correctness, wrt our specification, of Demoen's definition of bagof for Prolog in Prolog. The specification of bagof allows us to throw some light on the logical problems with setof.

set predicates; Prolog; solution-collecting predicates

nije evidentirano