Order Total (1 Item Items):
Shipping Destination:
Termination Proofs Logic Programs by Lutz Plumer (11 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (11)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (8)
- As New, Fine or Near Fine (2)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (1)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (11)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (8)
- Not Print on Demand (7)
Language (1)
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
Condition: Normal. Springer-Verlag. Germany, 1990 24 x 15,5 cm., 142 pag. Tapa blanda;buen estado de conservacion. INTELIGENCIA ARTIFICIAL . Ejemplares disponibles: 1 Normal.
-
Termination Proofs for Logic Programs (Lecture Notes in Computer Science, 446)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 67.83
US$ 15.99 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 65.25
US$ 20.67 shipping
Ships from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPF. Condition: New.
-
Condition: New.
-
Termination Proofs for Logic Programs
Language: English
Published by Springer Berlin Heidelberg, 1990
ISBN 10: 3540528377 ISBN 13: 9783540528371
Taschenbuch. Condition: 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.
-
US$ 138.84
US$ 33.37 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Condition: As New. Unread book in perfect condition.
-
Termination Proofs for Logic Programs
Language: English
Published by Springer Berlin Heidelberg Jul 1990, 1990
ISBN 10: 3540528377 ISBN 13: 9783540528371
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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.
-
Termination Proofs for Logic Programs
Language: English
Published by Springer Berlin Heidelberg, 1990
ISBN 10: 3540528377 ISBN 13: 9783540528371
Condition: 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.
-
Termination Proofs for Logic Programs
Language: English
Published by Springer, Springer Jul 1990, 1990
ISBN 10: 3540528377 ISBN 13: 9783540528371
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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.
-
Taschenbuch. Condition: 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 Print on Demand.
