1990, ISBN: 3540528377
[EAN: 9783540528371], Neubuch, [PU: Springer Berlin Heidelberg], LOGIK; PHILOSOPHIE / AUTOMAT; LOGISCHEPROGRAMMIERUNG; PARTIELLEAUSWERTUNG; TERMINIERUNG; VERIFIKATION; AUTOMATION; LINEARP… mais…
AbeBooks.de AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Custos de envio: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… mais…
lehmanns.de Custos de envio: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… mais…
booklooker.de |
Termination Proofs for Logic Programs (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) - Livro de bolso
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… mais…
usa, usa | Biblio.co.uk |
1990, ISBN: 9783540528371
Buch, Softcover, 1990, [PU: Springer Berlin], Springer Berlin, 1990
lehmanns.de Custos de envio: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… mais…
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… mais…
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… mais…
Termination Proofs for Logic Programs (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) - Livro de bolso
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… mais…
1990, ISBN: 9783540528371
Buch, Softcover, 1990, [PU: Springer Berlin], Springer Berlin, 1990
Dados bibliográficos do melhor livro correspondente
Autor: | |
Título: | |
Número ISBN: |
Dados detalhados do livro - Termination Proofs for Logic Programs
EAN (ISBN-13): 9783540528371
ISBN (ISBN-10): 3540528377
Livro de bolso
Ano de publicação: 1990
Editor/Editora: Springer Berlin
142 Páginas
Peso: 0,246 kg
Livro na base de dados desde 2007-06-05T17:24:27-03:00 (Sao Paulo)
Página de detalhes modificada pela última vez em 2022-10-25T14:28:29-03:00 (Sao Paulo)
Número ISBN/EAN: 9783540528371
Número ISBN - Ortografia alternativa:
3-540-52837-7, 978-3-540-52837-1
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: plümer, plmer, lutz
Título do livro: logic for computer science, logics for artificial intelligence, lecture notes computer science, termination
Dados da editora
Autor: Lutz Plümer
Título: Lecture Notes in Artificial Intelligence; Lecture Notes in Computer Science; Termination Proofs for Logic Programs
Editora: Springer; Springer Berlin
142 Páginas
Ano de publicação: 1990-07-24
Berlin; Heidelberg; DE
Língua: Inglês
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.Outros livros adicionais, que poderiam ser muito similares com este livro:
Último livro semelhante:
9783540471639 Termination Proofs for Logic Programs (Lutz Plümer)
< Para arquivar...