Correctness and Completeness of Logic Programs (Q5277919): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1412.8739 / 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: Strong termination of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semantic basis for the termination analysis of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic program synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic + control: An example / 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: Inductive assertion method for logic pograms / 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: Inferring non-suspension conditions for logic programs with dynamic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pearl on SAT and SMT solving in Prolog / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relation between logic programming and logic specification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: cTI: a constraint-based termination inference tool for ISO-Prolog / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-valued semantics for logic programmers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truth versus information in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: <tt>Polytool</tt>: Polynomial interpretations as a basis for termination analysis of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transformational Approach to Program Development / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated termination proofs for logic programs by term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3718124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theoretical foundations of LPTP (a logic program theorem prover) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4844167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: XSB: Extending Prolog with Tabled Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank

Latest revision as of 02:26, 14 July 2024

scientific article; zbMATH DE number 6744237
Language Label Description Also known as
English
Correctness and Completeness of Logic Programs
scientific article; zbMATH DE number 6744237

    Statements

    Correctness and Completeness of Logic Programs (English)
    0 references
    12 July 2017
    0 references
    logic programming
    0 references
    declarative programming
    0 references
    program completeness
    0 references
    program correctness
    0 references
    specifications
    0 references
    declarative diagnosis/algorithmic debugging
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references