Jump to ContentJump to Main Navigation
Thinking as ComputationA First Course$
Users without a subscription are not able to see the full content.

Hector J. Levesque

Print publication date: 2012

Print ISBN-13: 9780262016995

Published to MIT Press Scholarship Online: August 2013

DOI: 10.7551/mitpress/9780262016995.001.0001

Show Summary Details
Page of

PRINTED FROM MIT PRESS SCHOLARSHIP ONLINE (www.mitpress.universitypressscholarship.com). (c) Copyright The MIT Press, 2018. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in MITSO for personal use.date: 17 October 2019

Case Study: Satisfying Constraints

Case Study: Satisfying Constraints

Chapter:
(p.85) 5 Case Study: Satisfying Constraints
Source:
Thinking as Computation
Author(s):

J. Levesque Hector

Publisher:
The MIT Press
DOI:10.7551/mitpress/9780262016995.003.0005

This chapter describes five different constraint satisfaction problems. The first section introduces the idea of constraint satisfaction problems and presents a general way of solving them. Each of the five remaining sections takes on a different constraint satisfaction problem (Sudoku, cryptarithmetic, the eight-queens problem, logic problems, and scheduling) and shows how finding a solution can be cast as a computational task in Prolog.

Keywords:   computer programming, Prolog programming, constraint satisfaction problems, problem solving

MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.