A01=Patrice Boizumault
Access IS
Age Group_Uncategorized
Age Group_Uncategorized
Algorithm
Annotation
APL (programming language)
Append
Author_Patrice Boizumault
automatic-update
B06=Ara M. Djamboulian
B06=Jamal Fattouh
Backtracking
Base address
Calculation
Category1=Non-Fiction
Category=PBUH
Category=UMX
Compiler
Computation
COP=United States
Copying
Defun
Delivery_Pre-order
Depth-first search
Detection
Direct binding
Entry point
eq_isMigrated=2
eq_nobargain
Expression (computer science)
Flowchart
Global variable
Goto
Heap (data structure)
Implementation
Inference
Information access
Initial condition
Instance (computer science)
Instruction set
Interpreter (computing)
Knowledge base
Language_English
Lisp (programming language)
Literal (computer programming)
Local variable
Logic programming
Lookup table
Memory address
Memory management
Notation
Object-oriented programming
PA=Temporarily unavailable
PAQ
Parameter (computer programming)
Parsing
Patch (computing)
Preprocessor
Price_€100 and above
Processing (programming language)
Programmer
Programming language
Prolog
PS=Active
Qsort
Recursion (computer science)
Reinforcement
Requirement
Result
Reusability
S-expression
Search tree
SICStus Prolog
softlaunch
Structured programming
Subroutine
Subset
Synchronization (computer science)
SYS (command)
Terminology
Test-driven development
Trigger strategy
Type conversion
Unification (computer science)
Unique key
Variable (computer science)
Warren Abstract Machine
Word (computer architecture)
Product details
- ISBN 9780691637709
- Weight: 595g
- Dimensions: 152 x 229mm
- Publication Date: 19 Apr 2016
- Publisher: Princeton University Press
- Publication City/Country: US
- Product Form: Hardback
- Language: English
Secure
checkout
Fast Shipping
Easy returns
A semantically well-defined programming language widely used in artificial intelligence, Prolog has greatly influenced other programming languages since its introduction in the late 1970s. A user may find Prolog deceptively easy, however, and there are a number of different implementations. In this book Patrice Boizumault draws from his extensive experience in Prolog implementation to describe for students of all levels the concepts, difficulties, and design limits of a Prolog system. Boizumault introduces the specific problems posed by the implementation of Prolog, studies and compares different solutions--notably those of the schools of Marseilles and Edinburgh--and concludes with three examples of implementation. Major points of interest include identifying the important differences in implementing unification and resolution; presenting three features of Prolog II--infinite trees, dif, and freeze--that introduce constraints; thoroughly describing Warren's Abstract Machine (WAM); and detailing a Lisp imple-mentation of Prolog. Originally published in 1993.
The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.
