scientific article; zbMATH DE number 6970799

DOI10.23638/LMCS-14(4:7)2018zbMATH Open1403.68105arXiv1710.10991MaRDI QIDQ4553285FDOQ4553285

Bertram Felgenhauer

Publication date: 2 November 2018

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

complexityconfluenceterm rewritingunique normal forms

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• CSI: new evidence -- a progress report
• Deciding confluence of certain term rewriting systems in polynomial time
• 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
• Fast congruence closure and extensions
• Confluence of curried term-rewriting systems
• Deciding Confluence of Ground Term Rewrite Systems in Cubic Time.

Cited In (2)

• First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
• Trace rewriting: Computing normal forms in time O(n log n)

Uses Software

• CSI

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553285)