Naslov
The Mathematics of Set Predicates in Prolog

Autori
Boerger, Egon ; Rosenzweig, Dean

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Computational Logic and Proof Theory / G. Gottlob, A. Leitsch, D. Mundici - Berlin : Springer, 1993, 1-13

Skup
Computational Logic and Proof Theory, Third Kurt Goedel Symposium

Mjesto i datum
Brno, Češka Republika, 20.08.93.-27.08.93

Vrsta sudjelovanja
Pozvano predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
set predicates; Prolog; solution-collecting predicates

Sažetak
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.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA