<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>02983cam a2200253 a 4500</leader>
  <controlfield tag="001">1/40050</controlfield>
  <controlfield tag="008">140627s2003    us            001 0 eng  </controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
   <subfield code="a">9781558608900</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
   <subfield code="a">1558608907</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="l">42782</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">OPELS</subfield>
   <subfield code="b">eng</subfield>
   <subfield code="c">OPELS</subfield>
   <subfield code="d">OCLCG</subfield>
   <subfield code="d">OCLCQ</subfield>
   <subfield code="d">E7B</subfield>
   <subfield code="d">OCLCO</subfield>
   <subfield code="d">OCLCF</subfield>
   <subfield code="d">GR-PeUP</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Dechter, Rina,</subfield>
   <subfield code="d">1950-</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Constraint processing</subfield>
   <subfield code="h">[electronic resource] /</subfield>
   <subfield code="c">Rina Dechter ; with contributions by David Cohen, Peter Jeavons, Francesca Rossi.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="a">San Francisco :</subfield>
   <subfield code="b">Morgan Kaufmann Publishers,</subfield>
   <subfield code="c">c2003.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">1 online resource (xx, 481 p.) :</subfield>
   <subfield code="b">ill.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">Constraint satisfaction is a simple but powerful tool. Constraints identify the impossible and reduce the realm of possibilities to effectively focus on the possible, allowing for a natural declarative formulation of what must be satisfied, without expressing how. The field of constraint reasoning has matured over the last three decades with contributions from a diverse community of researchers in artificial intelligence, databases and programming languages, operations research, management science, and applied mathematics. Today, constraint problems are used to model cognitive tasks in vision, language comprehension, default reasoning, diagnosis, scheduling, temporal and spatial reasoning. In Constraint Processing, Rina Dechter, synthesizes these contributions, along with her own significant work, to provide the first comprehensive examination of the theory that underlies constraint processing algorithms. Throughout, she focuses on fundamental tools and principles, emphasizing the representation and analysis of algorithms. Examines the basic practical aspects of each topic and then tackles more advanced issues, including current research challenges Builds the reader's understanding with definitions, examples, theory, algorithms and complexity analysis Synthesizes three decades of researchers work on constraint processing in AI, databases and programming languages, operations research, management science, and applied mathematics.</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
   <subfield code="a">Preface; Introduction; Constraint Networks; Consistency-Enforcing Algorithms: Constraint Propagation; Directional Consistency; General Search Strategies; General Search Strategies: Look-Back; Local Search Algorithms; Advanced Consistency Methods; Tree-Decomposition Methods; Hybrid of Search and Inference: Time-Space Trade-offs; Tractable Constraint Languages; Temporal Constraint Networks; Constraint Optimization; Probabilistic Networks; Constraint Logic Programming; Bibliography.</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
   <subfield code="a">Includes bibliographical references (p. [441]-458) and index.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
   <subfield code="a">Constraint programming (Computer science)</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="4">
   <subfield code="a">Electronic books.</subfield>
  </datafield>
  <datafield tag="852" ind1=" " ind2=" ">
   <subfield code="a">INST</subfield>
   <subfield code="b">UNIPILB</subfield>
   <subfield code="c">EBOOKS</subfield>
   <subfield code="e">20100616</subfield>
   <subfield code="p">00b42782</subfield>
   <subfield code="q">00b42782</subfield>
   <subfield code="t">ONLINE</subfield>
   <subfield code="y">0</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="3">ScienceDirect</subfield>
   <subfield code="u">http://www.sciencedirect.com/science/book/9781558608900</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
   <subfield code="d">/webopac/covers/02/42782_9781558608900.jpg</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
   <subfield code="d">/webopac/covers/02/42782_1558608907.jpg</subfield>
  </datafield>
 </record>
</collection>
