An algorithm for finding canonical sets of ground rewrite rules in polynomial time

Authors:
Jean Gallier;Paliath Narendran;David Plaisted;Stan Raatz;Wayne Snyder
Affiliations:
Univ. of Pennsylvania, Philadelphia;State Univ. of New York, Albany;Univ. of North Carolina, Chapel Hill;Rutgers Univ., New Brunswick, NJ;Boston Univ., Boston, MA
Venue:
Journal of the ACM (JACM)
Year:
1993

Citing 14
Cited 13

Logic for computer science: foundations of automatic theorem proving

Logic for computer science: foundations of automatic theorem proving
On recursive path ordering

Theoretical Computer Science
The word problem for finitely presented monoids and finite canonical rewriting systems

on Rewriting techniques and applications
Proof methods for equational theories

Proof methods for equational theories
Termination of rewriting

Journal of Symbolic Computation
Rigid E-unification: NP-completeness and applications to equational matings

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Theorem proving using equational matings and rigid E-unification

Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Theorem Proving via General Matings

Journal of the ACM (JACM)
On Matrices with Connections

Journal of the ACM (JACM)
Complexity of finitely presented algebras

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Complexity of Finitely Presented Algebras

Complexity of Finitely Presented Algebras

A taxonomy of parallel strategies for deduction

Annals of Mathematics and Artificial Intelligence
Intersection of finitely generated congruences over term algebra

Theoretical Computer Science
Term rewriting restricted to ground terms

Theoretical Computer Science
Abstract canonical inference

ACM Transactions on Computational Logic (TOCL)
Canonicity!

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Engineering DPLL(T) + Saturation

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
New results on rewrite-based satisfiability procedures

ACM Transactions on Computational Logic (TOCL)
On Deciding Satisfiability by DPLL($\Gamma+{\mathcal T}$) and Unsound Theorem Proving

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
On theorem proving for program checking: historical perspective and recent developments

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
On Deciding Satisfiability by Theorem Proving with Speculative Inferences

Journal of Automated Reasoning
Congruence closure of compressed terms in polynomial time

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
The Ground Tree Transducer Game

Fundamenta Informaticae
Simple and Minimal Ground Term Equation Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, it is shown that there is an algorithm that, given by finite set E of ground equations, produces a reduced canonical rewriting system R equivalent to E in polynomial time. This algorithm based on congruence closure performs simplification steps guided by a total simplification ordering on ground terms, and it runs in time O(n3).