1990, ISBN: 3540528377
[EAN: 9783540528371], Neubuch, [PU: Springer Berlin Heidelberg], LOGIK; PHILOSOPHIE / AUTOMAT; LOGISCHEPROGRAMMIERUNG; PARTIELLEAUSWERTUNG; TERMINIERUNG; VERIFIKATION; AUTOMATION; LINEARP… Altro …
AbeBooks.de AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Costi di spedizione: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… Altro …
lehmanns.de Costi di spedizione: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… Altro …
booklooker.de |
Termination Proofs for Logic Programs (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) - edizione con copertina flessibile
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… Altro …
usa, usa | Biblio.co.uk |
1990, ISBN: 9783540528371
Buch, Softcover, 1990, [PU: Springer Berlin], Springer Berlin, 1990
lehmanns.de Costi di spedizione: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… Altro …
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… Altro …
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… Altro …
Termination Proofs for Logic Programs (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) - edizione con copertina flessibile
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… Altro …
1990, ISBN: 9783540528371
Buch, Softcover, 1990, [PU: Springer Berlin], Springer Berlin, 1990
Dati bibliografici del miglior libro corrispondente
Autore: | |
Titolo: | |
ISBN: |
Informazioni dettagliate del libro - Termination Proofs for Logic Programs
EAN (ISBN-13): 9783540528371
ISBN (ISBN-10): 3540528377
Copertina flessibile
Anno di pubblicazione: 1990
Editore: Springer Berlin
142 Pagine
Peso: 0,246 kg
Libro nella banca dati dal 2007-06-05T22:24:27+02:00 (Rome)
Pagina di dettaglio ultima modifica in 2022-10-25T19:28:29+02:00 (Rome)
ISBN/EAN: 3540528377
ISBN - Stili di scrittura alternativi:
3-540-52837-7, 978-3-540-52837-1
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : plümer, plmer, lutz
Titolo del libro: logic for computer science, logics for artificial intelligence, lecture notes computer science, termination
Dati dell'editore
Autore: Lutz Plümer
Titolo: Lecture Notes in Artificial Intelligence; Lecture Notes in Computer Science; Termination Proofs for Logic Programs
Editore: Springer; Springer Berlin
142 Pagine
Anno di pubblicazione: 1990-07-24
Berlin; Heidelberg; DE
Lingua: Inglese
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.Altri libri che potrebbero essere simili a questo:
Ultimo libro simile:
9783540471639 Termination Proofs for Logic Programs (Lutz Plümer)
< Per archiviare...