A New Approach to Non-termination Analysis of Logic Programs (Q4649732): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144853448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4854006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination with (Boolean) Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992908 / 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: Automated Termination Analysis for Logic Programs by Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination prediction for general logic programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:25, 5 July 2024

scientific article; zbMATH DE number 6105007
Language Label Description Also known as
English
A New Approach to Non-termination Analysis of Logic Programs
scientific article; zbMATH DE number 6105007

    Statements

    A New Approach to Non-termination Analysis of Logic Programs (English)
    0 references
    0 references
    0 references
    13 November 2012
    0 references
    0 references
    non-termination analysis
    0 references
    program analysis
    0 references
    0 references