Negation and Control in Prolog


Book Description

The contributions to this volume cover all aspects of the assessment and management of hepatobiliary disease. The focal points of the book consist of three state-of-the-art summaries. The first of these deals with the highly topical problem of liver transplants from the point of view of patient selection. The second considers drug-induced liver injury in view of the fact that the liver is the main metabolic site for a number of drugs. The final summary deals with liver and aging: it asks whether the liver follows the aging process of the host organisms and whether the liver of aged liver transplant candidate donors could be suitable for grafting. Aside from these topics, the volume presents basic research on hepatic transport mechanisms, intrahepatic cholestasis and gall-stone disease, which serves as a background for the topics more specifically concerning the assessment of liver function. Much of the book is then devoted to the management of the commonest forms of liver diseases and their complications, such as chronic active hepatitis, liver cirrhosis, portal hypertension, hepatic encephalopathy, hepatorenal syndrome, and ascites.




Logic Programming with Prolog


Book Description

Written for those who wish to learn Prolog as a powerful software development tool, but do not necessarily have any background in logic or AI. Includes a full glossary of the technical terms and self-assessment exercises.




Logic for Programming, Artificial Intelligence, and Reasoning


Book Description

This volume contains the papers presented at the Eighth International C- ference on Logic for Programming, Arti?cial Intelligence and Reasoning (LPAR 2001), held on December 3-7, 2001, at the University of Havana (Cuba), together with the Second International Workshop on Implementation of Logics. There were 112 submissions, of which 19 belonged to the special subm- sion category of experimental papers, intended to describe implementations or comparisons of systems, or experiments with systems. Each submission was - viewed by at least three program committee members and an electronic program committee meeting was held via the Internet. The high number of submissions caused a large amount of work, and we are very grateful to the other 31 PC members for their e?ciency and for the quality of their reviews and discussions. Finally, the committee decided to accept 40papers in the theoretical ca- gory, and 9 experimental papers. In addition to the refereed papers, this volume contains an extended abstract of the invited talk by Frank Wolter. Two other invited lectures were given by Matthias Baaz and Manuel Hermenegildo. Apart from the program committee, we would also like to thank the other people who made LPAR 2001 possible: the additional referees; the Local Arran- ` gements Chair Luciano Garc ́?a; Andr ́es Navarro and Oscar Guell, ̈ who ran the internet-based submission software and the program committee discussion so- ware at the LSI Department lab in Barcelona; and Bill McCune, whose program committee management software was used.




The Art of Prolog, second edition


Book Description

This new edition of The Art of Prolog contains a number of important changes. Most background sections at the end of each chapter have been updated to take account of important recent research results, the references have been greatly expanded, and more advanced exercises have been added which have been used successfully in teaching the course. Part II, The Prolog Language, has been modified to be compatible with the new Prolog standard, and the chapter on program development has been significantly altered: the predicates defined have been moved to more appropriate chapters, the section on efficiency has been moved to the considerably expanded chapter on cuts and negation, and a new section has been added on stepwise enhancement—a systematic way of constructing Prolog programs developed by Leon Sterling. All but one of the chapters in Part III, Advanced Prolog Programming Techniques, have been substantially changed, with some major rearrangements. A new chapter on interpreters describes a rule language and interpreter for expert systems, which better illustrates how Prolog should be used to construct expert systems. The chapter on program transformation is completely new and the chapter on logic grammars adds new material for recognizing simple languages, showing how grammars apply to more computer science examples.




Programming in Prolog


Book Description

The computer programming language Prolog is quickly gaining popularity throughout the world. Since Its beginnings around 1970. Prolog has been chosen by many programmers for applications of symbolic computation. including: D relational databases D mathematical logic D abstract problem solving D understanding natural language D architectural design D symbolic equation solving D biochemical structure analysis D many areas of artificial Intelligence Until now. there has been no textbook with the aim of teaching Prolog as a practical programming language. It Is perhaps a tribute to Prolog that so many people have been motivated to learn It by referring to the necessarily concise reference manuals. a few published papers. and by the orally transmitted 'folklore' of the modern computing community. However. as Prolog is beginning to be Introduced to large numbers of undergraduate and postgraduate students. many of our colleagues have expressed a great need for a tutorial guide to learning Prolog. We hope this little book will go some way towards meeting this need. Many newcomers to Prolog find that the task of writing a Prolog program Is not like specifying an algorithm in the same way as In a conventional programming language. Instead. the Prolog programmer asks more what formal relationships and objects occur In his problem.




Logic Programming


Book Description

This book constitutes the refereed proceedings of the 20th International Conference on Logic Programming, ICLP 2004, held in Saint-Malo, France in September 2004. The 28 revised full papers and 16 poster papers presented together with 2 invited papers were carefully reviewed and selected from 70 submissions. The papers are organized in topical sections on program analysis, constraints, alternative programming paradigms, answer set programming, and implementation.




Knowledge Representation, Reasoning, and the Design of Intelligent Agents


Book Description

Knowledge representation and reasoning is the foundation of artificial intelligence, declarative programming, and the design of knowledge-intensive software systems capable of performing intelligent tasks. Using logical and probabilistic formalisms based on answer set programming (ASP) and action languages, this book shows how knowledge-intensive systems can be given knowledge about the world and how it can be used to solve non-trivial computational problems. The authors maintain a balance between mathematical analysis and practical design of intelligent agents. All the concepts, such as answering queries, planning, diagnostics, and probabilistic reasoning, are illustrated by programs of ASP. The text can be used for AI-related undergraduate and graduate classes and by researchers who would like to learn more about ASP and knowledge representation.




Foundations of Logic Programming


Book Description

In the two and a half years since the frrst edition of this book was published, the field of logic programming has grown rapidly. Consequently, it seemed advisable to try to expand the subject matter covered in the first edition. The new material in the second edition has a strong database flavour, which reflects my own research interests over the last three years. However, despite the fact that the second edition has about 70% more material than the first edition, many worthwhile topic!! are still missing. I can only plead that the field is now too big to expect one author to cover everything. In the second edition, I discuss a larger class of programs than that discussed in the first edition. Related to this, I have also taken the opportunity to try to improve some of the earlier terminology. Firstly, I introduce "program statements", which are formulas of the form A+-W, where the head A is an atom and the body W is an arbitrary formula. A "program" is a finite set of program statements. There are various restrictions of this class. "Normal" programs are ones where the body of each program statement is a conjunction of literals. (The terminology "general", used in the first edition, is obviously now inappropriate).




Logic, Programming and Prolog


Book Description

What sets this book apart from others on logic programming is the breadth of its coverage. The authors have achieved a fine balance between a clear and authoritative treatment of the theory and a practical, problem-solving approach to its applications. This edition introduces major new developments in a continually evolving field and includes such topics as concurrency and equational and constraint logic programming.




Computational Logic: Logic Programming and Beyond


Book Description

Alan Robinson This set of essays pays tribute to Bob Kowalski on his 60th birthday, an anniversary which gives his friends and colleagues an excuse to celebrate his career as an original thinker, a charismatic communicator, and a forceful intellectual leader. The logic programming community hereby and herein conveys its respect and thanks to him for his pivotal role in creating and fostering the conceptual paradigm which is its raison d’Œtre. The diversity of interests covered here reflects the variety of Bob’s concerns. Read on. It is an intellectual feast. Before you begin, permit me to send him a brief personal, but public, message: Bob, how right you were, and how wrong I was. I should explain. When Bob arrived in Edinburgh in 1967 resolution was as yet fairly new, having taken several years to become at all widely known. Research groups to investigate various aspects of resolution sprang up at several institutions, the one organized by Bernard Meltzer at Edinburgh University being among the first. For the half-dozen years that Bob was a leading member of Bernard’s group, I was a frequent visitor to it, and I saw a lot of him. We had many discussions about logic, computation, and language.