Closures and fairness in the semantics of programming logic (Q799098): Difference between revisions
From MaRDI portal
Removed claims |
Created claim: Wikidata QID (P12): Q127526099, #quickstatements; #temporary_batch_1721947978549 |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Jean-Louis Lassez / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Michael J. Maher / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Hirokazu Nishimura / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(84)90017-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092054572 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Contributions to the Theory of Logic Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constructive versions of Tarski's fixed point theorems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3922128 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3862380 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Closures and fairness in the semantics of programming logic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4139711 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4124327 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3664454 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3914393 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127526099 / rank | |||
Normal rank | |||
Latest revision as of 23:54, 25 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Closures and fairness in the semantics of programming logic |
scientific article |
Statements
Closures and fairness in the semantics of programming logic (English)
0 references
1984
0 references
Using the techniques of closures and chaotic iterations of P. Cousot and R. Cousot, the authors give a semantics to logic programs and then study some fixed point theorems, denotational semantics and the like. The final section is devoted to an extension of the characterization of SLD finite failure given by \textit{K. R. Apt} and \textit{M. H. van Emden} [J. Assoc. Comput. Mach. 29, 841-862 (1982; Zbl 0483.68004)].
0 references
SLD resolution
0 references
logic programs
0 references
fixed point theorems
0 references
denotational semantics
0 references
