Prolog Experiments in Discrete Mathematics, Logic, and Computability
by James Hein
Publisher: Portland State University 2009
Number of pages: 158
This book contains programming experiments that are designed to reinforce the learning of discrete mathematics, logic, and computability. It is the outgrowth of the experimental portion of a one-year course in discrete structures, logic, and computability for sophomores at Portland State University. The course has evolved over the last ten years from a standard course into a course that uses programming experiments as part of the required activity. Most of the experiments are short and to the point, just like traditional homework problems, so that they reflect the daily classroom work. The experiments in the book are organized to accompany the material in Discrete Structures, Logic, and Computability, Second Edition, by James L. Hein.
Download or read it online for free here:
by Paul Brna
These notes are designed for undergraduate students who have some programming experience. The function of the text is to provide students studying Artificial Intelligence with an intensive introduction to Prolog, there is a slight bias towards AI.
by J. R. Fisher - California State Polytechnic University, Pomona
Prolog is a logical and a declarative programming language. This tutorial is intended to help learn the essential, basic concepts of Prolog. The sample programs have been chosen to promote the use of Prolog in an artificial intelligence course.
by Ulf Nilsson, Jan Mauszynski - John Wiley & Sons Inc
This textbook provides a uniform account of both the foundations of logic programming and simple programming techniques in the programming language Prolog. The authors limited their attention to the most important areas of logic programming.
by Patrick Blackburn, Kristina Striegnitz - Union College
Contents: Finite State Automata; Finite State Parsers and Transducers; Finite State Methods in Natural Language Processing; Recursive Transition Networks (RTNs); RTN transducers and ATNs; Definite Clause Grammars; Bottom Up, Top Down Parsing; etc.