Download:
|
by Reinhard Bundgen
Integrating Symbolic Mathematical Computation and Arti Intelligence. Proceedings of AISMC-2, volume 958 of LNCS
http://www-sr.informatik.uni-tuebingen.de/~buendgen/RESEARCH/../PAPERS/aimsc2.ps.gz
Add To MetaCart
Abstract:
Abstract: We present extended term rewriting systems as a means to describe a simplification relation for an equational specification with a built-in domain of external objects. Even if the extended term rewriting system is canonical, the combined relation including built-in computations of `ground terms ' needs neither be terminating nor confluent. We investigate restrictions on the extended term rewriting systems and the built-in domains under which these properties hold. A very important property of extended term rewriting systems is decomposition freedom. Among others decomposition free extended term rewriting systems allow for efficient simplifications. Some interesting algebraic applications of canonical simplification relations are presented. 1
Citations
|
422
|
Mathematica : A system for doing mathematics by computer
– WOLFRAM
- 1991
|
|
418
|
Simple word problems in universal algebras
– Knuth, Bendix
- 1970
|
|
414
|
Termination of rewriting
– Dershowitz
- 1987
|
|
151
|
Canonical forms and unification
– Hullot
- 1980
|
|
125
|
Completion of a set of rules modulo a set of equations
– Jouannaud, Kirchner
- 1986
|
|
122
|
Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Mathematisches Institut der Universit"at Innsbruck
– Buchberger
- 1979
|
|
109
|
Complete Sets of Reductions for Some Equational Theories
– PETERSON, STICKEL
- 1981
|
|
68
|
A unification algorithm for associative-commutative functions
– Stickel
- 1981
|
|
50
|
A Criterion for Detecting Unnecessary Reductions in the Construction of Gröbner Bases
– Buchberger
- 1979
|
|
44
|
Modular properties of composable term rewriting systems
– Ohlebusch
- 1995
|
|
34
|
On theories with a combinatorial definition of "equivalence
– Newman
- 1942
|
|
19
|
Algebraic Simplification
– BUCHBERGER, LOOS
- 1982
|
|
16
|
Simple termination of hierarchical combinations of term rewriting systems
– Rao
- 1994
|
|
12
|
Buchberger's algorithm: The term rewriter's point of view
– Bundgen
- 1996
|
|
10
|
Simulating Buchberger's Algorithm by a Knuth-Bendix Completion Procedure
– Bundgen
- 1991
|
|
10
|
A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm
– Winkler, Buchberger
- 1985
|
|
9
|
Operational specifications with built-ins
– Avenhaus, Becker
- 1994
|
|
9
|
Associative-commutative pattern matching
– Hullot
- 1979
|
|
6
|
Systems of Reductions
– Benninghofen, Kemmerich, et al.
- 1987
|
|
6
|
Abstract rewriting with concrete operators
– Kaplan, Choppy
- 1989
|
|
4
|
Completion of integral polynomials by AC-term completion
– Bundgen
- 1991
|
|
4
|
A confluence criterion based on the generalised Newman lemma
– Kuchlin
- 1985
|
|
2
|
On pots, pans and pudding or how to discover generalized critical pairs
– Bundgen
- 1994
|
|
2
|
Preserving confluence for rewrite systems with builtin operations
– Bundgen
- 1994
|
