A fixpoint semantics of Horn sentences based on substitution sets (Q1100934): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q375309 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: John-Jules Ch. Meyer / rank | |||
Normal rank | |||
Revision as of 23:42, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fixpoint semantics of Horn sentences based on substitution sets |
scientific article |
Statements
A fixpoint semantics of Horn sentences based on substitution sets (English)
0 references
1987
0 references
A denotational semantics of Horn sentences is proposed yielding the set of substitutions with which atoms are derivable by unit deduction from the Horn sentence in question. In this way a direct correspondence is obtained between the semantics and the answer sets associated with computations. This enables one to give a denotational semantics of unsatisfiable Horn sentences as well.
0 references
logic programming
0 references
Horn clauses
0 references
denotational semantics
0 references
unit deduction
0 references
unsatisfiable Horn sentences
0 references
