Instantiation theory : on the foundations of automated deduction
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...
Zapisane w:
| 1. autor: | |
|---|---|
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science. Lecture notes in artificial intelligence
518 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Instantiation theory, on the foundations of automated deduction, J.G. Williams, Berlin, Springer-Verlag, 1991, 1 vol. (VIII-133 p.), Lecture notes in computer science, 3-540-54333-3 • Instantiation Theory, Texte imprimé, 9783662172476 |
| LEADER | 03820nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 971429 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155206958 | ||
| 020 | |a 9783540475613 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.3 | ||
| 082 | |a 004 | ||
| 100 | 1 | |a Williams, James G., |d 1939- | |
| 245 | 1 | 0 | |a Instantiation theory : |b on the foundations of automated deduction |c J. G. Williams. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science. Lecture notes in artificial intelligence |v 518 |x 1611-3349 |x 2945-9141 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 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. | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Théorèmes |x Démonstration automatique | ||
| 776 | 0 | |0 022167390 |t Instantiation theory |o on the foundations of automated deduction |f J.G. Williams |c Berlin |n Springer-Verlag |d 1991 |p 1 vol. (VIII-133 p.) |s Lecture notes in computer science |z 3-540-54333-3 | |
| 776 | 0 | |t Instantiation Theory |b Texte imprimé |z 9783662172476 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0031932 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-X5M8S3GJ-9 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750652675 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0031932 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754002926 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0031932 |z Accès INSA CVL | |
| 997 | |0 971429 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||