Use of Logical Models for Proving Operational Termination in General Logics (Q2827835): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Proving Termination Properties with mu-term / rank
 
Normal rank
Property / cites work
 
Property / cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving operational termination of membership equational programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3030249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials over the reals in proofs of termination : from theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational termination of conditional term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational Termination of Membership Equational Programs: the Order-Sorted Way / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Matrix Interpretations for Proving Termination of Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001345 / rank
 
Normal rank

Latest revision as of 19:30, 12 July 2024

scientific article
Language Label Description Also known as
English
Use of Logical Models for Proving Operational Termination in General Logics
scientific article

    Statements

    Identifiers