Advances in Logic Programming Theory by Giorgio LeviAdvances in Logic Programming Theory by Giorgio Levi

Advances in Logic Programming Theory

EditorGiorgio Levi

Hardcover | April 30, 1999

Pricing and Purchase Info

$213.30 online 
$237.00 list price save 10%
Earn 1,067 plum® points

Prices and offers may vary in store


Ships within 1-3 weeks

Ships free on orders over $25

Not available in stores


Logic programming has emerged over the last 5 years as one of the most promising new programming paradigms and as a very active research area. The PROLOG experience has shown that relevant problems in areas such as expert systems, deductive databases, knowledge representation, and rapid prototyping can profitably be tackled by logic programming technology. It has also shown that the performance of PROLOG systems can be made comparablewith more traditional programming languages by means of sophisticated optimization and implementation of the design of a new class of languages, the concurrent logic languages. Many recent advances in the theory of logic programs are related to extensions of the basic positive logic language and the related semantic problems. The original non-monotonic negation-as-failure rule has been extended in various ways and provided with new declarative characterisations. Othernew language constructs are constraints (which lead to a very important extension of the paradigm which allows us to compute on new domains), concurrency, and modules and objects. This book, written by a team of international experts, goes beyond the classical theory to discuss the many recent advances for the first time in a systematic form.
Giorgio Levi, Professor, Department of Informatics, University of Pisa.
Title:Advances in Logic Programming TheoryFormat:HardcoverDimensions:268 pagesPublished:April 30, 1999Publisher:Oxford University Press

The following ISBNs are associated with this title:

ISBN - 10:0198538537

ISBN - 13:9780198538530


Table of Contents

1. A comparison of notions with negation as failure2. From concurrent logic programming to concurrent constraint programming3. Formal bases for dataflow analysis of logic programs4. Modular termination proofs for logic and pure PROLOG programs5. Logic + control revisitedIndex