Deciding confluence of certain term rewriting systems in polynomial time (Q1886319): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ashish Kumar Tiwari / rank
 
Normal rank
Property / author
 
Property / author: Rakesh M. Verma / 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.1016/j.apal.2004.04.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050626079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract congruence closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on the Common Subexpression Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of term rewrite systems with polynomial confluence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability and confluence are undecidable for flat term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-rewriting, a term rewriting technique for monotonic order relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Decision Procedures Based on Congruence Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Church-Rosser property for ground term-rewriting systems is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for generating reduced ground rewriting systems from a set of ground equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and reductions for rewriting problems. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2730723 / rank
 
Normal rank

Latest revision as of 15:20, 7 June 2024

scientific article
Language Label Description Also known as
English
Deciding confluence of certain term rewriting systems in polynomial time
scientific article

    Statements

    Deciding confluence of certain term rewriting systems in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    18 November 2004
    0 references
    0 references
    Term rewriting
    0 references
    Confluence
    0 references
    Ground rewrite systems
    0 references
    Shallow linear rewrite systems
    0 references
    0 references