
Constraint-Based Reasoning
MIT Press
Published on 4. February 1994
Book
Paperback/Softback
409 pages
978-0-262-56075-7 (ISBN)
Description
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.Contents
Introduction, E. C. Freuder, A. K. Mackworth The Logic of Constraint Satisfaction, A. K. Mackworth Partial Constraint Satisfaction, E. C. Freuder, R. J. Wallace Constraint Reasoning Based on Interval Arithmetic: The Tolerance Propagation Approach, E. Hyvonen Constraint Satisfaction Using Constraint Logic Programming, P. Van Hentenryck, H. Simonis, M. Dincbas Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems, S. Minton, M. D. Johnston, A. B. Philips, and P. Laird Arc Consistency: Parallelism and Domain Dependence, P. R. Cooper, M. J. Swain Structure Identification in Relational Data, R. Dechter, J. Pearl Learning to Improve Constraint-Based Scheduling, M. Zweben, E. Davis, B. Daun, E. Drascher, M. Deale, M. Eskey Reasoning about Qualitative Temporal Information, P. van Beek A Geometric Constraint Engine, G. A. Kramer A Theory of Conflict Resolution in Planning, Q. YangA Bradford Book.
Introduction, E. C. Freuder, A. K. Mackworth The Logic of Constraint Satisfaction, A. K. Mackworth Partial Constraint Satisfaction, E. C. Freuder, R. J. Wallace Constraint Reasoning Based on Interval Arithmetic: The Tolerance Propagation Approach, E. Hyvonen Constraint Satisfaction Using Constraint Logic Programming, P. Van Hentenryck, H. Simonis, M. Dincbas Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems, S. Minton, M. D. Johnston, A. B. Philips, and P. Laird Arc Consistency: Parallelism and Domain Dependence, P. R. Cooper, M. J. Swain Structure Identification in Relational Data, R. Dechter, J. Pearl Learning to Improve Constraint-Based Scheduling, M. Zweben, E. Davis, B. Daun, E. Drascher, M. Deale, M. Eskey Reasoning about Qualitative Temporal Information, P. van Beek A Geometric Constraint Engine, G. A. Kramer A Theory of Conflict Resolution in Planning, Q. YangA Bradford Book.
More details
Series
Language
English
Place of publication
Cambridge, Mass.
United States
Publishing group
MIT Press Ltd
Target group
Professional and scholarly
Interest Age: From 18 years
Product notice
Paperback (trade)
Dimensions
Height: 251 mm
Width: 196 mm
Thickness: 23 mm
Weight
953 gr
ISBN-13
978-0-262-56075-7 (9780262560757)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification