scientific article; zbMATH DE number 6970799

DOI10.23638/LMCS-14(4:7)2018zbMath1403.68105arXiv1710.10991MaRDI QIDQ4553285

Bertram Felgenhauer

Publication date: 2 November 2018

Full work available at URL: https://arxiv.org/abs/1710.10991

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityconfluenceterm rewritingunique normal forms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Related Items

First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification

Uses Software

• CSI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the modularity of normal forms in rewriting
• Modular properties of conditional term rewriting systems
• Fast congruence closure and extensions
• Deciding confluence of certain term rewriting systems in polynomial time
• Confluence of curried term-rewriting systems
• Comparing curried and uncurried rewriting
• CSI: new evidence -- a progress report
• Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems
• Unique Normalization for Shallow TRS
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Fast Decision Procedures Based on Congruence Closure
• Term Rewriting and All That
• Polynomial time termination and constraint satisfaction tests
• Deciding Confluence of Ground Term Rewrite Systems in Cubic Time.
• On the Church-Rosser property for the direct sum of term rewriting systems