Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Termination of term rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of loop checking mechanisms for logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norms on terms and their use in proving universal termination of a logic program / 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: Mechanically proving termination using polynomial interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for automatic termination analysis od logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Interpretations for Proving Termination of Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT Solving for Termination Analysis with Polynomial Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular termination proofs for rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing and improving dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automating the dependency pair method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing positiveness of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-change principle for program termination / 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: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination proofs for logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition Invariants and Transition Predicate Abstraction for Program Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Termination Analysis for Logic Programs by Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-change principle and dependency pairs for termination of term rewriting / rank
 
Normal rank

Latest revision as of 23:29, 28 June 2024

scientific article; zbMATH DE number 5496624
Language Label Description Also known as
English
Termination Analysis of Logic Programs Based on Dependency Graphs
scientific article; zbMATH DE number 5496624

    Statements

    Termination Analysis of Logic Programs Based on Dependency Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers