|
|
|
|
| LEADER |
02853nmm a2200385 u 4500 |
| 001 |
EB000657947 |
| 003 |
EBX01000000000000000511029 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540475613
|
| 100 |
1 |
|
|a Williams, James G.
|
| 245 |
0 |
0 |
|a Instantiation Theory
|h Elektronische Ressource
|b On the Foundations of Automated Deduction
|c by James G. Williams
|
| 250 |
|
|
|a 1st ed. 1991
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1991, 1991
|
| 300 |
|
|
|a VIII, 136 p
|b online resource
|
| 505 |
0 |
|
|a Background -- General approaches to instantiation -- Classification properties -- Homomorphisms -- Construct bases -- Unification - an algorithm and its soundness -- Term-implementation and completeness -- Implementation and computational complexity -- Related issues not addressed
|
| 653 |
|
|
|a Computer science—Mathematics
|
| 653 |
|
|
|a Symbolic and Algebraic Manipulation
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Theory of Computation
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Artificial Intelligence
|
| 028 |
5 |
0 |
|a 10.1007/BFb0031932
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/BFb0031932?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 006.3
|
| 520 |
|
|
|a Instantiation 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
|