Matching in Flat Theories [1 citations — 0 self]
Download:
|
|
by Temur Kutsia
http://www.risc.uni-linz.ac.at/people/tkutsia/papers/Kutsia-UNIF03.ps
Add To MetaCart
Abstract:
Abstract. Flat theory with sequence variables and exible arity symbols has a decidable innitary matching and unication. We brie y describe a minimal complete at matching procedure and discuss its relations with the at matching implemented in the Mathematica system. 1
Citations
| 104 | Unification in the union of disjoint equational theories: Combining decision procedures – Baader, Schulz - 1996 |
| 17 | Solving and proving in equational theories with sequence variables and flexible arity symbols. PhD Thesis. Available from http://www.risc.uni-linz.ac.at/people/tkutsia/pub/Thesis.pdf – Kutsia - 2002 |
| 14 | Mathematica as a rewrite language – Buchberger - 1996 |
| 12 | Uni in the union of disjoint equational theories: Combining decision procedures – Baader, Schulz - 1996 |
| 2 | Introducing sequentica – Marin - 2002 |
