|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910812507903321 |
|
|
Autore |
Tsang Edward |
|
|
Titolo |
Foundations of constraint satisfaction / / Edward Tsang |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
London, England ; ; San Diego, California : , : Academic Press Limited, , 1993 |
|
©1993 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (440 p.) |
|
|
|
|
|
|
Collana |
|
Computation in Cognitive Science |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Constraints (Artificial intelligence) - Mathematics |
Constraints (Artificial intelligence) - Data processing |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Front Cover; Foundations of Constraint Satisfaction; Copyright Page; Series Preface; Dedication; Preface; Acknowledgements; Table of Contents; Notations and abbreviations; Chapter 1. Introduction; 1.1 What is a constraint satisfaction problem?; 1.2 Formal Definition of the CSP; 1.3 Constraint Representation and Binary CSPs; 1.4 Graph-related Concepts; 1.5 Examples and Applications of CSPs; 1.6 Constraint Programming; 1.7 Structure Of Subsequent Chapters; 1.8 Bibliographical Remarks; Chapter 2. CSP solving - An overview; 2.1 Introduction; 2.2 Problem Reduction |
2.3 Searching For Solution Tuples2.4 Solution Synthesis; 2.5 Characteristics of Individual CSPs; 2.6 Summary; 2.7 Bibliographical Remarks; Chapter 3. Fundamental concepts in the CSP; 3.1 Introduction; 3.2 Concepts Concerning Satisfiability and Consistency; 3.3 Relating Consistency to Satisfiability; 3.4 (i,j)-consistency; 3.5 Redundancy of Constraints; 3.6 More Graph-related Concepts; 3.7 Discussion and Summary; 3.8 Bibliographical Remarks; Chapter 4. Problem reduction; 4.1 Introduction; 4.2 Node and Arc-consistency Achieving Algorithms; 4.3 Path-consistency Achievement Algorithms |
4.4 Post-conditions of PC Algorithms4.5 Algorithm for Achieving k-consistency; 4.6 Adaptive-consistency; 4.7 Parallel/Distributed Consistency Achievement; 4.8 Summary; 4.9 Bibliographical Remarks; Chapter 5. Basic search strategies for solving CSPs; 5.1 Introduction; |
|
|
|
|