Picture 1 of 1

Stock photo

Constraint-Based Reasoning (Special Issues of Artificial Intelligence) - Picture 1 of 1

Special Issues of Artificial Intelligence Ser.: Constraint-Based Reasoning by Alan K. Mackworth and Eugene C. Freuder (1994, Trade Paperback)

ZBK Books (160364)

99.1% positive feedback

Price:

$95.45

Free shipping

Estimated delivery Wed, Aug 20 - Tue, Aug 26

Returns:

30 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Good

Pages and cover are intact. Limited notes marks and highlighting may be present. May show signs of normal shelf wear and bends on edges. Item may be missing CDs or access codes.

About this product

Product Identifiers

PublisherMIT Press

ISBN-100262560755

ISBN-139780262560757

eBay Product ID (ePID)97306

Product Key Features

Number of Pages410 Pages

Publication NameConstraint-Based Reasoning

LanguageEnglish

SubjectIntelligence (Ai) & Semantics, General

Publication Year1994

TypeTextbook

Subject AreaComputers, Philosophy

AuthorAlan K. Mackworth, Eugene C. Freuder

SeriesSpecial Issues of Artificial Intelligence Ser.

FormatTrade Paperback

Dimensions

Item Height0.9 in

Item Weight33.9 Oz

Item Length9.8 in

Item Width7.7 in

Additional Product Features

Intended AudienceScholarly & Professional

LCCN93-021600

Dewey Edition20

Grade FromCollege Graduate Student

IllustratedYes

Dewey Decimal006.3

SynopsisConstraint-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. Yang A Bradford Book., 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. Yang A Bradford Book.