No label defined (Q3221399)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3888910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3888910 |
Statements
1984
0 references
infinite computations
0 references
logic programming
0 references
infinite derivations
0 references
operational semantics
0 references
fair derivations
0 references
fixed point semantics
0 references
0 references
0.9174382
0 references
0 references
0 references
0.9087214
0 references
0 references
0 references
0.89975977
0 references
[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.
0 references