Eugene C. Freuder, Alan K. Mackworth
MIT Press, 1994 - Computers - 403 pages
Constraint-based reasoning is an important area of automated reasoning in artificial intelligence, with many applications. These include configuration and design problems, planning and scheduling, temporal and spatial reasoning, defeasible and causal reasoning, machine vision and language understanding, qualitative and diagnostic reasoning, and expert systems. Constraint-Based Reasoning presents current work in the field at several levels: theory, algorithms, languages, applications, and hardware. Constraint-based reasoning has connections to a wide variety of fields, including formal logic, graph theory, relational databases, combinatorial algorithms, operations research, neural networks, truth maintenance, and logic programming. The ideal of describing a problem domain in natural, declarative terms and then letting general deductive mechanisms synthesize individual solutions has to some extent been realized, and even embodied, in programming languages.
A Bradford Book.
What people are saying - Write a review
E G Freuder and A K Mackworth
Freuder and R J Wallace
P Van Hentenryck H Simonis and M Dincbas
S Minton M D Johnston A B Philips and P Laird
P R Cooper and M J Swain
R Dechter and J Pearl