scientific article; zbMATH DE number 3888910

From MaRDI portal
Publication:3221399





[For the entire collection see Zbl 0543.00014.] After having given a motivation for the use of infinite computations in logic programming the author presents the theory behind these infinite computations: the basic notions of logic programming are treated in a nutshell and extended to deal with infinite derivations. A canonical partition of the complete Herbrand base is given in finite successful, finitely failing and fair infinite derivations. The main result is the equivalence of an operational semantics based upon fair derivations and a greatest fixed point semantics.




Cited in
(23)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3221399)