Langue: anglais
Edité par Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1990
ISBN 10 : 3540528377 ISBN 13 : 9783540528371
Vendeur : Ammareal, Morangis, France
EUR 5,29
Quantité disponible : 1 disponible(s)
Ajouter au panierSoftcover. Etat : Très bon. Ancien livre de bibliothèque. Salissures sur la tranche. Edition 1990. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Stains on the edge. Edition 1990. Ammareal gives back up to 15% of this item's net price to charity organizations.
Vendeur : Libros Ambigú, Madrid, M, Espagne
EUR 4,20
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : Normal. Springer-Verlag. Germany, 1990 24 x 15,5 cm., 142 pag. Tapa blanda;buen estado de conservacion. INTELIGENCIA ARTIFICIAL . Ejemplares disponibles: 1 Normal.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 58,82
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
EUR 72,51
Quantité disponible : 15 disponible(s)
Ajouter au panierEtat : New.
EUR 56,58
Quantité disponible : 10 disponible(s)
Ajouter au panierPF. Etat : New.
Langue: anglais
Edité par Springer Berlin Heidelberg, 1990
ISBN 10 : 3540528377 ISBN 13 : 9783540528371
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 53,49
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
EUR 50,25
Quantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Termination Proofs for Logic Programs | Lutz Plümer | Taschenbuch | viii | Englisch | 1990 | Springer | EAN 9783540528371 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 120,40
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
EUR 151,45
Quantité disponible : 15 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Langue: anglais
Edité par Springer Berlin Heidelberg Jul 1990, 1990
ISBN 10 : 3540528377 ISBN 13 : 9783540528371
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 53,49
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - 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.
Langue: anglais
Edité par Springer Berlin Heidelberg, 1990
ISBN 10 : 3540528377 ISBN 13 : 9783540528371
Vendeur : moluna, Greven, Allemagne
EUR 48,37
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. 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. But until now there was little hope that termination proofs for nontrivial programs could be achiev.
Langue: anglais
Edité par Springer, Springer Jul 1990, 1990
ISBN 10 : 3540528377 ISBN 13 : 9783540528371
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 53,49
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book presents a technique for the automatic generation of termination proofs for logic programs, which constitute a crucial part of program verification. Several nontrivial examples are discussed.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 156 pp. Englisch.