Titlebook: Rewriting Techniques and Applications; 7th International Co Harald Ganzinger Conference proceedings 1996 Springer-Verlag Berlin Heidelberg

DRAFT

AC-complete unification and its application to theorem proving,-complete .-unification, a new technique whose goal is to reduce the number of AC-critical pairs inferred by performing unification in a extension . of AC (. ACU, Abelian groups, Boolean rings, ...) in the process of normalized completion [24, 25]. The idea is to represent complete sets of AC-unifie

強壯

Superposition theorem proving for abelian groups represented as integer modules,to substantially reduce the number of inferences compared to a standard superposition prover which applies the axioms directly. Specifically, equational literals are simplified, so that only the maximal term of the sums is on the left-hand side. Only certain minimal superpositions need to be conside

水土

紡織品

Termination of constructor systems,ms because for constructor systems instead of left- and right-hand sides of rules it is sufficient to compare so-called . [Art96]. Unfortunately, standard techniques for the generation of well-founded orderings cannot be directly used for the automation of the dependency pair approach. To solve this

招致

多嘴多舌

托人看管

Mnemonics

定點

古老