[EAN: 9783540528371], Neubuch, [PU: Springer Berlin Heidelberg], LOGIK; PHILOSOPHIE / AUTOMAT; LOGISCHEPROGRAMMIERUNG; PARTIELLEAUSWERTUNG; TERMINIERUNG; VERIFIKATION; AUTOMATION; LINEARPREDICATEINEQUALITIES; LINEAREPRÄDIKATUNGLEICHUNGEN; LOGICPROGRAMS; PARTIALEVALUATION; PROGRAMMING; SEMANTICS; VERIFICATION, Druck auf Anfrage Neuware - 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 specialdifficulties 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. 156 pp. Englisch, Books<
Buch, Softcover, 1990, Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. But un… Mehr…
Buch, Softcover, 1990, 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. [PU: Springer Berlin], Seiten: 142, Springer Berlin, 1990<
lehmanns.de
Versandkosten:Versand in 10-14 Tagen. (EUR 0.00) Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Termination proofs consti… Mehr…
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. Bu, DE, [SC: 0.00], Neuware, gewerbliches Angebot, Softcover, 142, [GW: 510g], 1990, Banküberweisung, PayPal<
booklooker.de
Moluna GmbH Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Springer, 1990-08-24. Paperback. Very Good. Ex-library paperback in very nice condition with the usual markings and attachments., Springer, 1990-08-24, 3, Springer, 1990-08-24. Paperba… Mehr…
Springer, 1990-08-24. Paperback. Very Good. Ex-library paperback in very nice condition with the usual markings and attachments., Springer, 1990-08-24, 3, Springer, 1990-08-24. Paperback. Good., Springer, 1990-08-24, 2.5<
[EAN: 9783540528371], Neubuch, [PU: Springer Berlin Heidelberg], LOGIK; PHILOSOPHIE / AUTOMAT; LOGISCHEPROGRAMMIERUNG; PARTIELLEAUSWERTUNG; TERMINIERUNG; VERIFIKATION; AUTOMATION; LINEARPREDICATEINEQUALITIES; LINEAREPRÄDIKATUNGLEICHUNGEN; LOGICPROGRAMS; PARTIALEVALUATION; PROGRAMMING; SEMANTICS; VERIFICATION, Druck auf Anfrage Neuware - 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 specialdifficulties 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. 156 pp. Englisch, Books<
Buch, Softcover, 1990, Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. But un… Mehr…
Buch, Softcover, 1990, 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. [PU: Springer Berlin], Seiten: 142, Springer Berlin, 1990<
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Termination proofs consti… Mehr…
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. Bu, DE, [SC: 0.00], Neuware, gewerbliches Angebot, Softcover, 142, [GW: 510g], 1990, Banküberweisung, PayPal<
Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Moluna GmbH
Springer, 1990-08-24. Paperback. Very Good. Ex-library paperback in very nice condition with the usual markings and attachments., Springer, 1990-08-24, 3, Springer, 1990-08-24. Paperba… Mehr…
Springer, 1990-08-24. Paperback. Very Good. Ex-library paperback in very nice condition with the usual markings and attachments., Springer, 1990-08-24, 3, Springer, 1990-08-24. Paperback. Good., Springer, 1990-08-24, 2.5<
USA, USA - Versandkosten: EUR 11.14 GuthrieBooks, Ergodebooks
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.
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.
Detailangaben zum Buch - Termination Proofs for Logic Programs
EAN (ISBN-13): 9783540528371 ISBN (ISBN-10): 3540528377 Taschenbuch Erscheinungsjahr: 1990 Herausgeber: Springer Berlin 142 Seiten Gewicht: 0,246 kg
Buch in der Datenbank seit 2007-06-05T22:24:27+02:00 (Berlin) Detailseite zuletzt geändert am 2022-10-25T19:28:29+02:00 (Berlin) ISBN/EAN: 3540528377
ISBN - alternative Schreibweisen: 3-540-52837-7, 978-3-540-52837-1 Alternative Schreibweisen und verwandte Suchbegriffe: Autor des Buches: plümer, plmer, lutz Titel des Buches: logic for computer science, logics for artificial intelligence, lecture notes computer science, termination
Daten vom Verlag:
Autor/in: Lutz Plümer Titel: Lecture Notes in Artificial Intelligence; Lecture Notes in Computer Science; Termination Proofs for Logic Programs Verlag: Springer; Springer Berlin 142 Seiten Erscheinungsjahr: 1990-07-24 Berlin; Heidelberg; DE Sprache: Englisch 53,49 € (DE) 54,99 € (AT) 59,00 CHF (CH) Available VIII, 142 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Künstliche Intelligenz; Verstehen; Automat; Logische Programmierung; Partielle Auswertung; Terminierung; Verifikation; automation; linear predicate inequalities; lineare Prädikatungleichungen; logic; logic programs; partial evaluation; programming; semantics; termination; verification; Artificial Intelligence; Compilers and Interpreters; Software Engineering; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Compiler und Übersetzer; Software Engineering; Theoretische Informatik; EA
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.
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
