## Instantiation Theory: On the Foundations of Automated DeductionInstantiation Theory presents a new, general unification algorithm that is of immediate use in building theorem provers and logic programming systems. Instantiation theory is the study of instantiation in an abstract context that is applicable to most commonly studied logical formalisms. The volume begins with a survey of general approaches to the study of instantiation, as found in tree systems, order-sorted algebras, algebraic theories, composita, and instantiation systems. A classification of instantiation systems is given, based on properties of substitutions, degree of type strictness, and well-foundedness of terms. Equational theories and the use of typed variables are studied in terms of quotient homomorphisms and embeddings, respectively. Every instantiation system is a quotient system of a subsystem of first-order term instantiation. The general unification algorithm is developed as an application of the basic theory. Its soundness is rigorously proved, and its completeness and efficiency are verfied for certain classes of instantiation systems. Appropriate applications of the algorithm include unification of first-order terms, order-sorted terms, and first-order formulas modulo alpha-conversion, as well as equational unification using simple congruences. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

I | 1 |

IV | 2 |

V | 4 |

VII | 7 |

VIII | 9 |

IX | 11 |

XI | 17 |

XII | 18 |

XXX | 61 |

XXXII | 64 |

XXXIII | 65 |

XXXIV | 68 |

XXXV | 70 |

XXXVI | 75 |

XXXVII | 81 |

XXXIX | 83 |

### Other editions - View all

### Common terms and phrases

abstract Assertion Assume base multiequations baseg bijection break_cycle cdm(o computation congruence relation construct basis control nondeterminacy defined discriminating set dom(o dom(r end loop equivalence relation equivalent Example Exercise exit conditions feasibly finite first-order term instantiation follows directly full subsystem functional composition G.meq homomorphism infinite instance instantiation system isomorphism J.meq loop invariant merge merge_1 merge(8 minimal nonvariables monoid action multieq_ptr multiset null occurs check occurs properly order-sorted system Package body partial functions predicate calculus Proof proper fixed point quotient system induced reduction Section size(E substitutions are variable-preserving term system Theorem tree implementation tree-unifier triangular enumeration type theory type-preserving unification algorithm unification2 unifies_2c unifiesg unify2 unique quotients untyped v e var(t var(c var(d var(s variable-valued variables vc_reduce vdc(E voc(v w_reduce weakening weakly restrictable weight function well-founded witness set wt(t