Termination by absence of infinite chains of dependency pairs (Q5878910): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integration of functions into logic programming: From theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of equational logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic termination proofs with transformation orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting: Interpretation and type elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847000 / rank
 
Normal rank

Latest revision as of 13:21, 31 July 2024

scientific article; zbMATH DE number 7656675
Language Label Description Also known as
English
Termination by absence of infinite chains of dependency pairs
scientific article; zbMATH DE number 7656675

    Statements

    Identifiers