Termination proofs for logic programs
Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. But until now there was little hope that termination proofs for nontrivial programs could be achieved automatically. This book gives a compreh...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science. Lecture notes in artificial intelligence
446 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Termination proofs for logic programs, Lutz Plümer, 1990, Berlin, Paris [etc.], Springer-Verlag, 1 vol. (viii-142 p.), Lecture notes in computer science, 3-540-52837-7 • Termination Proofs for Logic Programs, Texte imprimé, 9783662176948 |
| LEADER | 03308nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 969732 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155178601 | ||
| 020 | |a 9783540471639 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 006.3 | ||
| 100 | 1 | |a Plümer, Lutz, |d 1951- | |
| 245 | 1 | 0 | |a Termination proofs for logic programs |c Lutz Plümer. |
| 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 446 |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 Basic notions -- Static program properties and transformations -- Terminating logic programs -- The problem of local variables -- And/or dataflow graphs -- A termination proof procedure -- Integration of unfolding techniques -- Conclusions. | |
| 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 Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. But until now there was little hope that termination proofs for nontrivial programs could be achieved automatically. This book gives a comprehensive discussion of the termination problem in the context of logic programming. Although logic programs pose special difficulties for termination proofs it turns out that automation of this task is obtainable to a much larger degree than for programs in imperative languages. A technique for the automatic derivation of termination proofs is presented in detail. The discussion of several nontrivial examples illustrates its range of applicability. The approach is based on the concept of declarative semantics, and thus makes use of an important feature of logic programming. | ||
| 650 | |a Génie logiciel | ||
| 650 | |a Informatique | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Programmation logique | ||
| 776 | 0 | |0 021630089 |t Termination proofs for logic programs |f Lutz Plümer |d 1990 |c Berlin |n Paris [etc.] |n Springer-Verlag |p 1 vol. (viii-142 p.) |s Lecture notes in computer science |z 3-540-52837-7 | |
| 776 | 0 | |t Termination Proofs for Logic Programs |b Texte imprimé |z 9783662176948 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-52837-7 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-K7L8H0MQ-P |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750670851 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-52837-7 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754019713 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-52837-7 |z Accès INSA CVL | |
| 997 | |0 969732 |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/ | ||