On Completeness of Logic Programs (Q2949713): 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: 1411.3015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851550 / 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: Q4875865 / 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: Correctness and Completeness of Logic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Completeness of Logic Programs / 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: Transformation of logic programs: Foundations and techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transformational Approach to Program Development / 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

Latest revision as of 20:11, 10 July 2024

scientific article
Language Label Description Also known as
English
On Completeness of Logic Programs
scientific article

    Statements

    On Completeness of Logic Programs (English)
    0 references
    2 October 2015
    0 references
    logic programming
    0 references
    program completeness
    0 references
    declarative programming
    0 references
    approximate specification
    0 references

    Identifiers