Twelfth Annual IEEE Symposium on

Logic in Computer Science (LICS 1997)

Paper: Combination of Compatible Reduction Orderings that are Total on Ground Terms (at LICS 1997)

Authors: Franz Baader


Reduction orderings that are compatible with an equational theory E and total on (the E-equivalence classes of) ground terms play an important role in automated deduction. This paper presents a general approach for combining such orderings: it shows how E1-compatible reduction orderings total on S1-ground terms and E2-compatible reduction orderings total on S2-ground terms can be used to construct an E-compatible reduction ordering total on S-ground terms (where F is the union of the theories E1 and E2, and S is the union of the signatures S1 and S2), provided that S1 and S2 are disjoint and some other (rather weak) restrictions are satisfied. 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.


    author = 	 {Franz Baader},
    title = 	 {Combination of Compatible Reduction Orderings that are Total on Ground Terms},
    booktitle =  {Proceedings of the Twelfth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1997},
    year =	 1997,
    editor =	 {Glynn Winskel},
    month =	 {June}, 
    pages =      {2--13},
    location =   {Warsaw, Poland}, 
    publisher =	 {IEEE Computer Society Press}