Claude Marche. Normalized rewriting: an alternative to rewriting modulo a set of equations. Journal of Symbolic Computation, 21(3):253-288, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Survey of Some Recent Trends in Rewrite-Based and.. - Nieuwenhuis (Correct)
....under equational ordered paramodulation w.r.t. a west ordering extending a give reduction ordering r , and let R denote the (unique) canonical TRS for E and r . Then E 0 R. 4 Building in abelian groups Paramodulation with built in abelian groups (AG) has been investigated by many authors [Che86,Mar94,Mar96,GW96,Wal98,Wal99,Stu98]. This is not surprising since abelian groups are of course ubiquitous in many applications of (semi )automated reasoning. But building in AG is also attractive for at least two more reasons. On the one hand, due to the fact that diophantine equation solving is easier in the integers than in the ....
....restrict inferences to this maximal summand and to avoid the prolific inferences with extended equations that appear in the AC case. Symmetrization is also exploited in March e s framework for Knuth Bendix completion of unit equations with built in theories (ranging from AC to commutative rings) [Mar94,Mar96]. His completion procedure decides the ground word problem modulo AG by building a finite convergent rewrite system. However, his procedure is not refutation complete for equations with variables: in many cases it fails since it cannot handle symmetrization at the non ground level. 4.1 Recent ....
Claude March'e. Normalized rewriting: An alternative to rewriting Modulo a set of equations. Journal of Symbolic Computation, 21(3):253--288, March 1996.
Paramodulation with Built-In Abelian Groups - Godoy, Nieuwenhuis (2000) (2 citations) (Correct)
....specialized techniques to work efficiently with standard algebraic theories, since a nave handling of some axioms (like associativity and commutativity, AC) leads to an explosion of the search space. Paramodulation with built in abelian groups (AG) has been investigated by many authors [6, 23, 11, 12, 10, 21, 22, 18]. This is not surprising since abelian groups are of course ubiquitous in many applications of (semi )automated reasoning. But building in AG is also attractive for at least two more reasons. On the one hand, due to the fact that diophantine equation solving is easier in the integers than in the ....
....to restrict inferences to this maximal summand and to avoid the prolific inferences with extended equations that appear in the AC case. Symmetrisation is also exploited in Marche s framework for Knuth Bendixcompletion of unit equations with built in theories (ranging from AC to commutative rings) [11, 12]. His completion procedure decides the ground word problem modulo AG by building a finite convergent rewrite system. However, his procedure is not refutation complete for equations with variables: in many cases it fails since it cannot handle symmetrisation at the non ground level. Full ....
C. Marche. Normalized rewriting: An alternative to rewriting Modulo a set of equations. Journal of Symbolic Computation, 21(3):253--288, Mar. 1996.
Paramodulation with Built-In Abelian Groups - Godoy, Nieuwenhuis (2000) (2 citations) (Correct)
....specialized techniques to work efficiently with standard algebraic theories, since a nave handling of some axioms (like associativity and commutativity, AC) leads to an explosion of the search space. Paramodulation with built in abelian groups (AG) has been investigated by many authors [6, 23, 11, 12, 10, 21, 22, 18]. This is not surprising since abelian groups are of course ubiquitous in many applications of (semi )automated reasoning. But building in AG is also attractive for at least two more reasons. On the one hand, due to the fact that diophantine equation solving is easier in the integers than in the ....
....to restrict inferences to this maximal summand and to avoid the prolific inferences with extended equations that appear in the AC case. Symmetrisation is also exploited in Marche s framework for Knuth Bendixcompletion of unit equations with built in theories (ranging from AC to commutative rings) [11, 12]. His completion procedure decides the ground word problem modulo AG by building a finite convergent rewrite system. However, his procedure is not refutation complete for equations with variables: in many cases it fails since it cannot handle symmetrisation at the non ground level. Full ....
C. Marche. Normalized rewriting: An alternative to rewriting Modulo a set of equations. Journal of Symbolic Computation, 21(3):253--288, Mar. 1996.
Generic Completion (Version 1) - Bündgen (1998) (Correct)
....pair theorems. Some kind of consolidation was given in [Bun96a, Bun98] where the same effects can be observed using a normalized rewriting strategy during a symmetrization based completion. For term rewriting systems, Marche presents a procedure for completion modulo a canonical rewrite system S [Mar96]. The normalized reduction relation in S normal forms is in general not compatible. The degree of non compatibility depends on the kind of the so called normalizing pairs used. Marche uses a proof transformation approach to prove correctness and completeness of this completion procedure. Both the ....
.... Delta Delta an i o hb 0 Delta Delta Delta b m i then hC[a 0 ] Delta Delta Delta C[an ]i o hC[b 0 ] Delta Delta Delta C[bm ]i for all C 2 C. However this property is neither needed in the proof of Theorem 8 nor in the remaining proofs concerning proof orderings. Marche [Mar96] presents a proof ordering that does not need compatibility w. r. t. substitutions. But compatibility w. r. t. term replacement is still required. Let us close this section describing an appropriate proof ordering. The ordering we present here is slightly less complicated than the one given in ....
[Article contains additional citation context not shown here]
Claude Marche. Normalized rewriting: an alternative to rewriting modulo a set of equations. Journal of Symbolic Computation, 11(1), 1996. (to appear).
Modular & Incremental Proofs of AC-Termination - Marche, Urbain Self-citation (March) (Correct)
No context found.
Claude March. Normalized rewriting: an alternative to rewriting modulo a set of equations. Journal of Symbolic Computation, 21(3):253288, 1996.
About the Confluence of Equational Pattern Rewrite Systems - Boudet, Contejean (Correct)
No context found.
Claude Marche. Normalized rewriting: an alternative to rewriting modulo a set of equations. Journal of Symbolic Computation, 21(3):253-288, 1996.
Superposition with Completely Built-in Abelian Groups - Godoy, Nieuwenhuis (Correct)
No context found.
Claude March'e. Normalized rewriting: An alternative to rewriting Modulo a set of equations. Journal of Symbolic Computation, 21(3):253--288, March 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC