Termination Proofs Logic Programs by Plumer Lutz (11 results)
- Softcover
Seller: Libros Ambigú, Madrid, M, SpainLibros Ambigú
Contact seller4-star sellerCondition: Used
£ 3.70
£ 26.48 shippingShips from Spain to U.S.A.Quantity: 1 available
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.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 49.34
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
£ 47.47
£ 15.49 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
PF. Condition: New.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
£ 62.87
£ 1.98 shippingShips within U.S.A.Quantity: 15 available
Condition: New.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 47.06
£ 52.31 shippingShips from Germany to U.S.A.Quantity: 1 available
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.
- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 101.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
£ 131.34
£ 1.98 shippingShips within U.S.A.Quantity: 15 available
Condition: As New. Unread book in perfect condition.
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 47.06
£ 19.65 shippingShips from Germany to U.S.A.Quantity: 2 available
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.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 42.56
£ 41.85 shippingShips from Germany to U.S.A.Quantity: Over 20 available
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.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 47.06
£ 51.26 shippingShips from Germany to U.S.A.Quantity: 1 available
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.
More images- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 44.22
£ 59.80 shippingShips from Germany to U.S.A.Quantity: 5 available
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.
