Reduction orderings that are compatible with an equational theory E and total on (the E-equivalence classes of) ground terms play an important rôle in automated deduction. We present a general approach for combining such orderings. To be more precise, we show how E1-compatible reduction orderings total on Σ1-ground terms and E2-compatible reduction orderings total on Σ2-ground terms can be used to construct an (E1[E2)-compatible reduction ordering total on (Σ1 [Σ2)-ground terms, provided that the signatures are disjoint and some other (rather weak) restrictions are satised. This work was motivated by the observation that it is often easier to construct such orderings for „small” signatures and theories separately, rather than directly for their union.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:78805 |
| Date | 18 May 2022 |
| Creators | Baader, Franz |
| Publisher | Aachen University of Technology |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/acceptedVersion, doc-type:report, info:eu-repo/semantics/report, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | urn:nbn:de:bsz:14-qucosa2-785040, qucosa:78504 |
Page generated in 0.002 seconds