论文信息 - Associative-Commutative Rewriting

Associative-Commutative Rewriting

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.

[1] Jieh Hsiang,et al. Topics in Automated Theorem Proving and Program Generation , 1983 .

[2] Nachum Dershowitz. Orderings for Term-Rewriting Systems , 1979, FOCS.

[3] Gérard P. Huet,et al. Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[4] Robert A. Kowalski,et al. Predicate Logic as Programming Language , 1974, IFIP Congress.

[5] Nachum Dershowitz,et al. Rewrite Methods for Clausal and Non-Clausal Theorem Proving , 1983, ICALP.

[6] Zohar Manna,et al. Proving termination with multiset orderings , 1979, CACM.

[7] Jack K. Cohen,et al. Computer-Implemented Set Theory , 1980 .

[8] Christopher J. Hogger,et al. Derivation of Logic Programs , 1981, JACM.

[9] Mark E. Stickel,et al. A Unification Algorithm for Associative-Commutative Functions , 1981, JACM.

[10] Nachum Dershowitz,et al. Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[11] Mark E. Stickel,et al. Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[12] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .

[13] Pierre Lescanne,et al. Computer experiments with the REVE term rewriting system generator , 1983, POPL '83.

[14] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .