Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tyrolean / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_30 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1489202196 / 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: Q3917482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Match-bounded string rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination proofs for string rewriting systems via inverse match-bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree automata that certify termination of left-linear term rewriting systems / 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: Frontiers of Combining Systems / 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: Tyrolean termination tool: techniques and features / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination of Rewrite Systems Using Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability for left-linear growing term rewriting systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of string rewriting proved automatically / rank
 
Normal rank

Latest revision as of 19:44, 28 June 2024

scientific article
Language Label Description Also known as
English
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
scientific article

    Statements

    Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (English)
    0 references
    0 references
    0 references
    20 November 2008
    0 references
    0 references
    0 references

    Identifiers