Instantiation Theory: On The Foundations Of Automated Deduction available on January 31 2017 from Indigo for 116.95
Instantiation Theory: On the Foundations of Automated Deduction (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) available on February 15 2015 from Amazon for 17.50
ISBN bar code 9783540543336 ξ1 registered January 31 2017
ISBN bar code 9783540543336 ξ2 registered February 15 2015
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.
^Instantiation Theory: On The Foundations Of Automated DeductionIndigo. ISBN 9783540543336 (revised Jan 2017)
^James G. WilliamsInstantiation Theory: On the Foundations of Automated Deduction (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence), Springer. Amazon. ISBN 9783540543336 (revised Feb 2015)
