Proving completeness of logic programs with the cut (Q511027): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00165-016-0392-0 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The witness properties and the semantics of the Prolog cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about termination of pure Prolog programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated termination analysis for logic programs with cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong termination of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple operational and denotational semantics for Prolog with cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof methods of declarative properties of definite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive assertion method for logic pograms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving correctness and completeness of normal programs – a declarative approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Completeness of Logic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correctness and Completeness of Logic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On definite program answers and least Herbrand models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative semantics for prolog with cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics for Prolog with Cut – Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3718124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational and goal-independent denotational semantics for Prolog with cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4844167 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130853227 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00165-016-0392-0 / rank
 
Normal rank

Latest revision as of 19:53, 9 December 2024

scientific article
Language Label Description Also known as
English
Proving completeness of logic programs with the cut
scientific article

    Statements

    Proving completeness of logic programs with the cut (English)
    0 references
    14 February 2017
    0 references
    logic programming
    0 references
    cut
    0 references
    operational semantics
    0 references
    program completeness
    0 references
    program correctness
    0 references

    Identifiers