Synopsis
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 special difficulties 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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Termination Proofs for Logic Programs: 446 (Lecture...
Stock Image
Termination Proofs for Logic Programs
Published by
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1990
ISBN 10: 3540528377
ISBN 13: 9783540528371
Used
Softcover
Seller: Ammareal, Morangis, France
Seller rating 5 out of 5 stars
Softcover. Condition: 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. Seller Inventory # E-627-515
Stock Image
Termination Proofs for Logic Programs
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540528371
Buy New
£ 47.47
£ 15.49 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 10 available
Seller Image
Termination Proofs for Logic Programs
Published by
Springer Berlin Heidelberg Jul 1990, 1990
ISBN 10: 3540528377
ISBN 13: 9783540528371
New
Taschenbuch
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. Seller Inventory # 9783540528371
Seller Image
Termination Proofs for Logic Programs
Published by
Springer Berlin Heidelberg, 1990
ISBN 10: 3540528377
ISBN 13: 9783540528371
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
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. Seller Inventory # 4892538
Buy New
£ 43.47
£ 42.75 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Termination Proofs for Logic Programs
Published by
Springer Berlin Heidelberg Jul 1990, 1990
ISBN 10: 3540528377
ISBN 13: 9783540528371
New
Taschenbuch
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 -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 special difficulties 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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 156 pp. Englisch. Seller Inventory # 9783540528371
Seller Image
Termination Proofs for Logic Programs
Published by
Springer Berlin Heidelberg, 1990
ISBN 10: 3540528377
ISBN 13: 9783540528371
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 9783540528371
Seller Image
Termination Proofs for Logic Programs
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 102139939
Stock Image
Termination Proofs for Logic Programs (Lecture Notes in Computer Science (446))
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA79035405283776
Buy Used
£ 101
£ 25 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available