Cover Image
Read Now

Constraint-based reasoning

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 understand...

Full description

Bibliographic Details
Main Author: Freuder, Eugene C.
Other Authors: Mackworth, Alan K.
Format: eBook
Language:English
Published: Cambridge, Mass. MIT Press 1994
Subjects:
Constraints (artificial Intelligence)
Reasoning
Computer Science/artificial Intelligence
Online Access:
Collection: MIT Press eBook Archive - Collection details see MPG.ReNa
LEADER 03024nmm a2200301 u 4500
001 EB002070866
003 EBX01000000000000001210956
005 00000000000000.0
007 cr|||||||||||||||||||||
008 220922 ||| eng
020 |a 0262288443 
020 |a 9780262288446 
050 4 |a Q340 
100 1 |a Freuder, Eugene C. 
245 0 0 |a Constraint-based reasoning  |h Elektronische Ressource  |c edited by Eugene C. Freuder and Alan K. Mackworth 
260 |a Cambridge, Mass.  |b MIT Press  |c 1994 
300 |a 403 pages  |b illustrations 
653 |a Constraints (Artificial intelligence) 
653 |a Reasoning 
653 |a COMPUTER SCIENCE/Artificial Intelligence 
700 1 |a Mackworth, Alan K. 
041 0 7 |a eng  |2 ISO 639-2 
989 |b MITArchiv  |a MIT Press eBook Archive 
500 |a "A Bradford book.". - Reprinted from Artificial intelligence, volume 58, numbers 1-3, 1992 
028 5 0 |a 10.7551/mitpress/2122.001.0001 
856 4 0 |u https://doi.org/10.7551/mitpress/2122.001.0001?locatt=mode:legacy  |x Verlag  |3 Volltext 
082 0 |a 006.3 
520 |a 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 

Similar Items