Constraint Satisfaction Techniques for Agent-Based Reasoning

Constraint satisfaction problems are significant in the domain of automated reasoning for artificial intelligence. They can be applied to the modeling and solving of a wide range of combinatorial applications such as planning, scheduling and resource sharing in a variety of practical domains such as...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Neagu, Nicoleta (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Basel : Birkhäuser Basel, 2005.
Σειρά:Whitestein Series in Software Agent Technologies
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02350nam a22004695i 4500
001 978-3-7643-7319-1
003 DE-He213
005 20151204162619.0
007 cr nn 008mamaa
008 100301s2005 sz | s |||| 0|eng d
020 |a 9783764373191  |9 978-3-7643-7319-1 
024 7 |a 10.1007/b137139  |2 doi 
040 |d GrThAP 
050 4 |a Q334-342 
050 4 |a TJ210.2-211.495 
072 7 |a UYQ  |2 bicssc 
072 7 |a TJFM1  |2 bicssc 
072 7 |a COM004000  |2 bisacsh 
082 0 4 |a 006.3  |2 23 
100 1 |a Neagu, Nicoleta.  |e author. 
245 1 0 |a Constraint Satisfaction Techniques for Agent-Based Reasoning  |h [electronic resource] /  |c by Nicoleta Neagu. 
264 1 |a Basel :  |b Birkhäuser Basel,  |c 2005. 
300 |a XII, 158 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Whitestein Series in Software Agent Technologies 
505 0 |a Interchangeability and Solution Adaptation in Crisp CSPs -- Interchangeability in Soft CSPs -- Multi Agent Computation of Interchangeability in Distributed CSPs -- Interchangeability in Dynamic Environments -- Generic Case Adaptation Framework -- Conclusions. 
520 |a Constraint satisfaction problems are significant in the domain of automated reasoning for artificial intelligence. They can be applied to the modeling and solving of a wide range of combinatorial applications such as planning, scheduling and resource sharing in a variety of practical domains such as transportation, production, supply-chains, network management and human resource management. In this book we study new techniques for solving constraint satisfaction problems, with a special focus on solution adaptation applied to agent reasoning. 
650 0 |a Computer science. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Computer Science, general. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783764372170 
830 0 |a Whitestein Series in Software Agent Technologies 
856 4 0 |u http://dx.doi.org/10.1007/b137139  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)