Autonomous agents have become a vibrant research and development topic in recent years attracting activity and attention from various areas. The basic agent concept incorporates proactive autonomous units with goal-directed-behaviour and communication capabilities. The book focuses on autonomous agents that can act in a goal directed manner under real time constraints and incomplete knowledge, being situated in a dynamic environment where resources may be restricted. To satisfy such complex requirements, the author improves, combines, and applies results from areas like planning, constraint programming, and local search. The formal framework developed is evaluated by application to the field of computer games, which fit the problem context very well since most of them are played in real time and provide a highly interactive environment where environmental situations are changing rapidly.

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.

The ubiquity of combinatorial optimization problems in our society is illustrated by the novel application areas for optimization technology, which range from supply chain management to sports tournament scheduling. Over the last two decades, constraint programming has emerged as a fundamental methodology to solve a variety of combinatorial problems, and rich constraint programming languages have been developed for expressing and combining constraints and specifying search procedures at a high level of abstraction. Local search approaches to combinatorial optimization are able to isolate optimal or near-optimal solutions within reasonable time constraints. This book introduces a method for solving combinatorial optimization problems that combines constraint programming and local search, using constraints to describe and control local search, and a programming language, COMET, that supports both modeling and search abstractions in the spirit of constraint programming. After an overview of local search including neighborhoods, heuristics, and metaheuristics, the book presents the architecture and modeling and search components of constraint-based local search and describes how constraint-based local search is supported in COMET. The book describes a variety of applications, arranged by meta-heuristics. It presents scheduling applications, along with the background necessary to understand these challenging problems. The book also includes a number of satisfiability problems, illustrating the ability of constraint-based local search approaches to cope with both satisfiability and optimization problems in a uniform fashion.

This volume constitutes the refereed proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, CP 2000, held in Singapore in September 2000. The 31 revised full papers and 13 posters presented together with three invited contributions were carefully reviewed and selected from 101 submissions. All current issues of constraint processing, ranging from theoretical and foundational issues to applications in various fields are addressed.

Complex Automated Negotiations have been widely studied and are becoming an important, emerging area in the field of Autonomous Agents and Multi-Agent Systems. In general, automated negotiations can be complex, since there are a lot of factors that characterize such negotiations. These factors include the number of issues, dependency between issues, representation of utility, negotiation protocol, negotiation form (bilateral or multi-party), time constraints, etc. Software agents can support automation or simulation of such complex negotiations on the behalf of their owners, and can provide them with adequate bargaining strategies. In many multi-issue bargaining settings, negotiation becomes more than a zero-sum game, so bargaining agents have an incentive to cooperate in order to achieve efficient win-win agreements. Also, in a complex negotiation, there could be multiple issues that are interdependent. Thus, agent’s utility will become more complex than simple utility functions. Further, negotiation forms and protocols could be different between bilateral situations and multi-party situations. To realize such a complex automated negotiati on, we have to incorporate advanced Artificial Intelligence technologies includes search, CSP, graphical utility models, Bays nets, auctions, utility graphs, predicting and learning methods. Applications could include e-commerce tools, decisionmaking support tools, negotiation support tools, collaboration tools, etc. These issues are explored by researchers from different communities in Autonomous Agents and Multi-Agent systems. They are, for instance, being studied in agent negotiation, multi-issue negotiations, auctions, mechanism design, electronic commerce, voting, secure protocols, matchmaking & brokering, argumentation, and co-operation mechanisms. This book is also edited from some aspects of negotiation researches including theoretical mechanism design of trading based on auctions, allocation mechanism based on negotiation among multi-agent, case-study and analysis of automated negotiations, data engineering issues in negotiations, and so on.

Distributed Constraint Satisfaction gives an overview of Constraint Satisfaction Problems (CSPs), adapts related search algorithms and consistency algorithms for applications to multi-agent systems, and consolidates recent research devoted to cooperation in such systems. The techniques introduced are applied to various problems in multi-agent systems. Among the new approaches is a hybrid-type algorithm for weak-commitment search combining backtracking and iterative improvement. Also, an extension of the basic CSP formalization called "Partial CSP" is introduced in order to handle over-constrained CSPs.

The Internet is revolutionizing retail merchandising and shopping. Software agents are capable of automating the more routine, tedious and time-consuming tasks involved in the trading process. Internet Commerce and Software Agents: Cases, Technologies and Opportunities addresses some major Internet commerce issues and the challenges to be met in achieving automated and secure Internet trading.