| 000 | 00884camuuu200265 a 4500 | |
| 001 | 000000917032 | |
| 005 | 19990115104658.0 | |
| 008 | 930607s1994 maua b 001 0 eng | |
| 010 | ▼a 93021600 | |
| 020 | ▼a 0262560755 : ▼c $41.94 | |
| 040 | ▼a DLC ▼c DLC ▼d DLC ▼d 244002 | |
| 049 | 0 | ▼l 151011520 ▼l 151011399 |
| 050 | 0 0 | ▼a Q340 ▼b .C65 1994 |
| 082 | 0 0 | ▼a 006.3 ▼2 20 |
| 090 | ▼a 006.3 ▼b C758 | |
| 245 | 0 0 | ▼a Constraint-based reasoning / ▼c edited by Eugene C. Freuder and Alan K. Mackworth. |
| 260 | ▼a Cambridge, Mass. : ▼b MIT Press, ▼c 1994. | |
| 300 | ▼a 403 p. : ▼b ill. ; ▼c 26 cm. | |
| 500 | ▼a "A Bradford book." | |
| 500 | ▼a Reprinted from Artificial intelligence, volume 58, numbers 1-3, 1992. | |
| 504 | ▼a Includes bibliographical references and index. | |
| 650 | 0 | ▼a Constraints (Artificial intelligence). |
| 650 | 0 | ▼a Reasoning. |
| 700 | 1 | ▼a Freuder, Eugene C. |
| 700 | 1 | ▼a Mackworth, Alan K. |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 세종학술정보원/과학기술실(5층)/ | 청구기호 006.3 C758 | 등록번호 151011399 | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
| No. 2 | 소장처 세종학술정보원/과학기술실(5층)/ | 청구기호 006.3 C758 | 등록번호 151011520 (1회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
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.
정보제공 :
목차
CONTENTS Introduction to the Special Volume on Constraint-Based Reasoning = 1 The logic of constraint satisfaction = 3 Partial contraint satisfaction = 21 Constraint reasoning based on interval arithmetic : the tolerance propagation approach = 71 Constraint satisfaction using constraint logic programming = 113 Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems = 161 Arc consistency: parallelism and domain dependence = 207 Structure identification in relational data = 237 Learning to improve constraint-based scheduling = 271 Reasoning about qualitative temporal information = 297 A geometric constraint engine = 327 A theory of conflict resolution in planning = 361 Index = 393