Constraint Satisfaction Techniques for Agent-Based Reasoning

Constraint Satisfaction Techniques for Agent-Based Reasoning

Show other versions (1)

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

Full description

Bibliographic Details
Main Author: Neagu, Nicoleta (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Basel : Birkhäuser Basel, 2005.
Series:Whitestein Series in Software Agent Technologies
Subjects:
Computer science.
Artificial intelligence.
Computer Science.
Artificial Intelligence (incl. Robotics).
Computer Science, general.
Online Access:Full Text via HEAL-Link

Internet

Full Text via HEAL-Link

ΒΚΠ - Πατρα: ALFd

Holdings details from ΒΚΠ - Πατρα: ALFd
Call Number: 330.01 BAU
Copy 1 Available

ΒΚΠ - Πατρα: BSC

Holdings details from ΒΚΠ - Πατρα: BSC
Call Number: 330.01 BAU
Copy 2 Available
Copy 3 Available

Similar Items