Prolog Experiments in Discrete Mathematics, Logic, and Computability
by James Hein
Publisher: Portland State University 2009
Number of pages: 158
Description:
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:
Download link
(1.3MB, PDF)
Similar books
Adventure in Prologby Dennis Merritt - Springer
This book takes a pragmatic, rather than theoretical, approach to the language and is designed for programmers interested in adding this powerful language to their bag of tools. Much of the book is built around the writing of a short adventure game.
(20279 views)
Building Expert Systems in Prologby Dennis Merritt - Amzi! inc.
This book is designed to teach you how to build expert systems from the inside out. The author presents the various features used in expert systems, shows how to implement them in Prolog, and how to use them to solve problems.
(16603 views)
Prolog Techniquesby Attila Csenki - BookBoon
This is the first of two volumes by the author on the programming language Prolog and its applications. In the first volume you can read about the accumulator technique, difference lists, program manipulations and exploratory code development.
(16852 views)
Natural Language Processing Techniques in Prologby 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.
(6987 views)