1990, ISBN: 3540528377
[EAN: 9783540528371], Neubuch, [PU: Springer Berlin Heidelberg], LOGIK; PHILOSOPHIE / AUTOMAT; LOGISCHEPROGRAMMIERUNG; PARTIELLEAUSWERTUNG; TERMINIERUNG; VERIFIKATION; AUTOMATION; LINEARP… More...
AbeBooks.de AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Shipping costs:Versandkostenfrei. (EUR 0.00) Details... |
1990, ISBN: 9783540528371
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… More...
lehmanns.de Shipping costs:Versand in 10-14 Tagen. (EUR 0.00) Details... |
1990, ISBN: 9783540528371
[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… More...
booklooker.de |
Termination Proofs for Logic Programs (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) - Paperback
1990, ISBN: 9783540528371
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… More...
usa, usa | Biblio.co.uk |
1990, ISBN: 9783540528371
Buch, Softcover, 1990, [PU: Springer Berlin], Springer Berlin, 1990
lehmanns.de Shipping costs:Versand in 10-14 Tagen. (EUR 0.00) Details... |
1990, ISBN: 3540528377
[EAN: 9783540528371], Neubuch, [PU: Springer Berlin Heidelberg], LOGIK; PHILOSOPHIE / AUTOMAT; LOGISCHEPROGRAMMIERUNG; PARTIELLEAUSWERTUNG; TERMINIERUNG; VERIFIKATION; AUTOMATION; LINEARP… More...
1990, ISBN: 9783540528371
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… More...
1990
ISBN: 9783540528371
[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… More...
Termination Proofs for Logic Programs (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) - Paperback
1990, ISBN: 9783540528371
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… More...
1990, ISBN: 9783540528371
Buch, Softcover, 1990, [PU: Springer Berlin], Springer Berlin, 1990
Bibliographic data of the best matching book
Author: | |
Title: | |
ISBN: |
Details of the book - Termination Proofs for Logic Programs
EAN (ISBN-13): 9783540528371
ISBN (ISBN-10): 3540528377
Paperback
Publishing year: 1990
Publisher: Springer Berlin
142 Pages
Weight: 0,246 kg
Book in our database since 2007-06-05T21:24:27+01:00 (London)
Detail page last modified on 2022-10-25T18:28:29+01:00 (London)
ISBN/EAN: 9783540528371
ISBN - alternate spelling:
3-540-52837-7, 978-3-540-52837-1
Alternate spelling and related search-keywords:
Book author: plümer, plmer, lutz
Book title: logic for computer science, logics for artificial intelligence, lecture notes computer science, termination
Information from Publisher
Author: Lutz Plümer
Title: Lecture Notes in Artificial Intelligence; Lecture Notes in Computer Science; Termination Proofs for Logic Programs
Publisher: Springer; Springer Berlin
142 Pages
Publishing year: 1990-07-24
Berlin; Heidelberg; DE
Language: English
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.More/other books that might be very similar to this book
Latest similar book:
9783540471639 Termination Proofs for Logic Programs (Lutz Plümer)
< to archive...