Termination of term rewriting using dependency pairs (Q1978641): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Termination by absence of infinite chains of dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving innermost normalisation automatically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of constructor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination by completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting systems by polynomial interpretations and its implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination of (conditional) rewrite systems. A semantic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3917482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automating the Knuth Bendix ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dummy elimination: Making termination easier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating polynomial orderings for termination proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of nested and mutually recursive algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proving termination by innermost termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular proofs for completeness of hierarchical term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting techniques and applications. 9th international conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple termination of rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating polynomial orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic termination proofs with transformation orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to termination for the direct sum of term rewriting systems / 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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(99)00207-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090855107 / rank
 
Normal rank

Latest revision as of 10:00, 30 July 2024

scientific article
Language Label Description Also known as
English
Termination of term rewriting using dependency pairs
scientific article

    Statements

    Termination of term rewriting using dependency pairs (English)
    0 references
    0 references
    4 June 2000
    0 references
    termination
    0 references
    term rewriting
    0 references
    dependency pairs
    0 references
    verification
    0 references
    automated theorem proving
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers