Constraint-based logic programming is the engine powering some of the most powerful algorithms in the world. Whether you’re building an airline schedule or planning routes for a trucking company, Prolog has the tools you need. You don’t have to struggle through thousands of pages of sample programs. This guide to Prolog will quickly ramp you up on the basic Prolog techniques you’ll need to solve the representative logical problems that Prolog is famous for.
Instead of working through dozens of fragmented code snippets written for different dialogs of Prolog, you can learn Prolog from a unified guide. You will start with the basics, defining the facts and inferences your programs will need to function. Then, you’ll learn the techniques to tie those facts together. You’ll finish off the basics by working through iconic problems like the map coloring problem. You’ll break into recursive solutions with the eight queens problem as you learn to explore logical problems requiring recursion and fixed dimensions.
Once you’ve picked up the basics, you’ll get right into the problem domains that made Prolog famous. You’ll navigate graphs to compute a working path, or even evaluate paths with the least distance or fastest times. You’ll not only learn what directed graphs are, but when to apply them. You’ll also get to use Prolog to solve scheduling problems. The basic algorithm will give you the tools to schedule a sports league tournament with special constraints.
Don’t settle for fragments of the big picture. Demand a consolidated approach that guides you through the process from beginning to end. Whether you’re learning logic programming to open up career possibilities or to excel in a class, you need this book.
What You Need
The examples in this book are based on SWI Prolog, one of the industry leading compilers.
Constraint-based logic programming is the engine powering some of the most powerful algorithms in the world. Whether you're building an airline schedule or planning routes for a trucking company, Prolog has the tools you need. You don't have to struggle through thousands of pages of sample programs. This guide to Prolog will quickly ramp you up on the basic Prolog techniques you'll need to solve the representative logical problems that Prolog is famous for.
Instead of working through dozens of fragmented code snippets written for different dialogs of Prolog, you can learn Prolog from a unified guide. You will start with the basics, defining the facts and inferences your programs will need to function. Then, you'll learn the techniques to tie those facts together. You'll finish off the basics by working through iconic problems like the map coloring problem. You'll break into recursive solutions with the eight queens problem as you learn to explore logical problems requiring recursion and fixed dimensions.
Once you've picked up the basics, you'll get right into the problem domains that made Prolog famous. You'll navigate graphs to compute a working path, or even evaluate paths with the least distance or fastest times. You'll not only learn what directed graphs are, but when to apply them. You'll also get to use Prolog to solve scheduling problems. The basic algorithm will give you the tools to schedule a sports league tournament with special constraints.
Don't settle for fragments of the big picture. Demand a consolidated approach that guides you through the process from beginning to end. Whether you're learning logic programming to open up career possibilities or to excel in a class, you need this book.
What You Need:
The examples in this book are based on SWI Prolog, one of the industry leading compilers.