Deciding confluence and normal form properties of ground term rewrite systems efficiently
From MaRDI portal
Publication:4553285
DOI10.23638/LMCS-14(4:7)2018zbMATH Open1403.68105arXiv1710.10991MaRDI QIDQ4553285FDOQ4553285
Authors: Bertram Felgenhauer 
Publication date: 2 November 2018
Full work available at URL: https://arxiv.org/abs/1710.10991
Recommendations
- Deciding confluence of ground term rewrite systems in cubic time
- Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems
- Deciding confluence of certain term rewriting systems in polynomial time
- A new decidability technique for ground term rewriting systems with applications
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
Cites Work
- CSI: new evidence -- a progress report
- Deciding confluence of certain term rewriting systems in polynomial time
- Title not available (Why is that?)
- Term Rewriting and All That
- Fast Decision Procedures Based on Congruence Closure
- Comparing curried and uncurried rewriting
- Modular properties of conditional term rewriting systems
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Algorithms and reductions for rewriting problems
- On the Church-Rosser property for the direct sum of term rewriting systems
- 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
- Polynomial time termination and constraint satisfaction tests
- On the modularity of normal forms in rewriting
- Title not available (Why is that?)
- Fast congruence closure and extensions
- Confluence of curried term-rewriting systems
- Title not available (Why is that?)
- Deciding confluence of ground term rewrite systems in cubic time
Cited In (5)
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
- Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems
- A new decidability technique for ground term rewriting systems with applications
- Trace rewriting: Computing normal forms in time O(n log n)
- Deciding confluence of ground term rewrite systems in cubic time
Uses Software
This page was built for publication: Deciding confluence and normal form properties of ground term rewrite systems efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553285)
