A fixpoint semantics of Horn sentences based on substitution sets (Q1100934): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: John-Jules Ch. Meyer / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: John-Jules Ch. Meyer / 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(87)90039-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991749458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution With Merging / 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: The Specialization of Programs by Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another Generalization of Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Refutations and Horn Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862380 / 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: A new combination of input and unit deductions for Horn sentences / rank
 
Normal rank

Latest revision as of 16:42, 18 June 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
    0 references
    0 references
    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
    0 references
    logic programming
    0 references
    Horn clauses
    0 references
    denotational semantics
    0 references
    unit deduction
    0 references
    unsatisfiable Horn sentences
    0 references
    0 references