Book Description

This book covers all that is needed by students on a one-year introductory Prolog course at first or second year degree level. It introduces Prolog to students as simply and painlessly as possible. Where Artificial Intelligence (AI) topics are introduced, they are easier ones and are treated simply. This book is Prolog for Students, with examples from AI, not a book on AI using Prolog. The text assumes access to a suitable, good, Prolog interpreter, such as LPA Prolog. It also assumes that students with an aptitude for research will follow it up with more advanced study, perhaps a third or fourth year option, and further reading suggestions are included. The book is organised with the basics of the subject introduced first, and covered gradually, so they can be fully understood before moving on to harder topics. The topics that students find more difficult, such as recursion and lists, are not covered until about half way through the book. There are many in-text questions, student self-testing questions and programming practice exercises throughout the book. If used to accompany a taught course, the material of one chapter can be covered in each week. This book covers all that is needed by students on a one-year introductory Prolog course at first or second year degree level. It introduces Prolog to students as simply and painlessly as possible. Where Artificial Intelligence (AI) topics are introduced, they are easier ones and are treated simply. This book is Prolog for Students, with examples from AI, not a book on AI using Prolog. The text assumes access to a suitable, good, Prolog interpreter, such as LPA Prolog. It also assumes that students with an aptitude for research will follow it up with more advanced study, perhaps a third or fourth year option, and further reading suggestions are included. The book is organised with the basics of the subject introduced first, and covered gradually, so they can be fully understood before moving on to harder topics. The topics that students find more difficult, such as recursion and lists, are not covered until about half way through the book. There are many in-text questions, student self-testing questions and programming practice exercises throughout the book. If used to accompany a taught course, the material of one chapter can be covered in each week.