Associative-commutative rewriting

Authors:
Nachum Dershowitz;Jien Hsiang;N. Alan Josephson;David A. Plaisted
Affiliations:
Department of Computer Science, University of Illinois, Urbana, IL;Department of Computer Science, State University of New York, Stony brook, NY;Department of Computer Science, University of Illinois, Urbana, IL;Computer Science Laboratory, SRI International, Menlo Park, CA
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Year:
1983

Citing 7
Cited 7

Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
Derivation of Logic Programs

Journal of the ACM (JACM)
A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)
Proving termination with multiset orderings

Communications of the ACM
Computer experiments with the REVE term rewriting system generator

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Rewrite Methods for Clausal and Non-Clausal Theorem Proving

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Proofs by induction in equational theories with constructors

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Termination orderings for associative-commutative rewriting systems

Journal of Symbolic Computation
Termination of rewriting

Journal of Symbolic Computation
Algebraic specification of Macintosh's Quickdraw using OBJ2

ICSE '88 Proceedings of the 10th international conference on Software engineering
Software process a` la algebra: OBJ for OBJ

ICSE '90 Proceedings of the 12th international conference on Software engineering
A Fully Syntactic AC-RPO

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Smart matching

AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Simplification Orderings: History Of Results

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We are currently extending the rewrite system laboratory REVE to handle associative-commutative operators. In particular, we are incorporating a set of rules for Boolean algebra that provides a refutationally-complete theorem prover and a new programming paradigm. To that end, we describe methods for proving termination of associative-commutative systems.