termination proofs logic programs von plumer lutz (11 Ergebnisse)

Softcover. Zustand: 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.

Zustand: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: Normal. Springer-Verlag. Germany, 1990 24 x 15,5 cm., 142 pag. Tapa blanda;buen estado de conservacion. INTELIGENCIA ARTIFICIAL . Ejemplares disponibles: 1 Normal.

Zustand: New. In.

PF. Zustand: New.

Taschenbuch. Zustand: 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.

Taschenbuch. Zustand: 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.

Paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Zustand: 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.

Zustand: 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.

Taschenbuch. Zustand: 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.