Coping with spatial expressions in a plausible manner is a crucial problem in a number of research fields, specifically cognitive science, artificial intelligence, psychology, and linguistics. This volume contains a set of theoretical analyses as well as accounts of applications which deal with the problems of representing and processing spatial expressions. These include dialogue understanding using mental images; interfaces to CAD and multi-media systems, such as natural language querying of photographic databases; speech-driven design and assembly; machine translation systems; spatial queries for Geographic Information Systems; and systems which generate spatial descriptions on the basis of maps, cognitive maps, or other spatial representations, such as intelligent vehicle navigation systems. Though there have been many different approaches to the representation and processing of spatial expressions, most existing computational characterizations have so far been restricted to particularly narrow problem domains, usually specific spatial contexts determined by overall system goals. To date, artificial intelligence research in this field has rarely taken advantage of language and spatial cognition studies carried out by the cognitive science community. One of the fundamental aims of this book is to bring together research from both disciplines in the belief that artificial intelligence has much to gain from an appreciation of cognitive theories.

Propositional logic has been recognized throughout the centuries as one of the cornerstones of reasoning in philosophy and mathematics. Over time, its formalization into Boolean algebra was accompanied by the recognition that a wide range of combinatorial problems can be expressed as propositional satisfiability (SAT) problems. Because of this dual role, SAT developed into a mature, multi-faceted scientific discipline, and from the earliest days of computing a search was underway to discover how to solve SAT problems in an automated fashion. This book, the Handbook of Satisfiability, is the second, updated and revised edition of the book first published in 2009 under the same name. The handbook aims to capture the full breadth and depth of SAT and to bring together significant progress and advances in automated solving. Topics covered span practical and theoretical research on SAT and its applications and include search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results. SAT is interpreted in a broad sense, so as well as propositional satisfiability, there are chapters covering the domain of quantified Boolean formulae (QBF), constraints programming techniques (CSP) for word-level problems and their propositional encoding, and satisfiability modulo theories (SMT). An extensive bibliography completes each chapter. This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work. Edmund Clarke, 2007 ACM Turing Award Recipient: "SAT solving is a key technology for 21st century computer science." Donald Knuth, 1974 ACM Turing Award Recipient: "SAT is evidently a killer app, because it is key to the solution of so many other problems." Stephen Cook, 1982 ACM Turing Award Recipient: "The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard?"

"The central fact is that we are planning agents." (M. Bratman, Intentions, Plans, and Practical Reasoning, 1987, p. 2) Recent arguments to the contrary notwithstanding, it seems to be the case that people-the best exemplars of general intelligence that we have to date do a lot of planning. It is therefore not surprising that modeling the planning process has always been a central part of the Artificial Intelligence enterprise. Reasonable behavior in complex environments requires the ability to consider what actions one should take, in order to achieve (some of) what one wants and that, in a nutshell, is what AI planning systems attempt to do. Indeed, the basic description of a plan generation algorithm has remained constant for nearly three decades: given a desciption of an initial state I, a goal state G, and a set of action types, find a sequence S of instantiated actions such that when S is executed instate I, G is guaranteed as a result. Working out the details of this class of algorithms, and making the elabora tions necessary for them to be effective in real environments, have proven to be bigger tasks than one might have imagined.

This book constitutes the refereed proceedings of the 9th International Conference on Principles and Practice of Constraint Programming, CP 2003, held in Kinsale, Ireland in September/October 2003. The 48 revised full papers and 34 revised short papers presented together with 4 invited papers and 40 abstracts of contributions to the CP 2003 doctoral program were carefully reviewed and selected from 181 submissions. A wealth of recent results in computing with constraints is addressed ranging from foundational and methodological issues to solving real-world problems in a variety of application fields.

Our ability to generate and collect data has been increasing rapidly. Not only are all of our business, scientific, and government transactions now computerized, but the widespread use of digital cameras, publication tools, and bar codes also generate data. On the collection side, scanned text and image platforms, satellite remote sensing systems, and the World Wide Web have flooded us with a tremendous amount of data. This explosive growth has generated an even more urgent need for new techniques and automated tools that can help us transform this data into useful information and knowledge. Like the first edition, voted the most popular data mining book by KD Nuggets readers, this book explores concepts and techniques for the discovery of patterns hidden in large data sets, focusing on issues relating to their feasibility, usefulness, effectiveness, and scalability. However, since the publication of the first edition, great progress has been made in the development of new data mining methods, systems, and applications. This new edition substantially enhances the first edition, and new chapters have been added to address recent developments on mining complex types of data— including stream data, sequence data, graph structured data, social network data, and multi-relational data. - A comprehensive, practical look at the concepts and techniques you need to know to get the most out of real business data - Updates that incorporate input from readers, changes in the field, and more material on statistics and machine learning - Dozens of algorithms and implementation examples, all in easily understood pseudo-code and suitable for use in real-world, large-scale data mining projects - Complete classroom support for instructors at www.mkp.com/datamining2e companion site

The proceedings of KR '94 comprise 55 papers on topics including deduction an search, description logics, theories of knowledge and belief, nonmonotonic reasoning and belief revision, action and time, planning and decision-making and reasoning about the physical world, and the relations between KR

This book constitutes the refereed procedings of the 6th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2000, held in Melbourne, Australia, August/September 2000. The 72 revised full papers presented together with 44 poster-abstracts were carefully reviewed and selected from a total of 207 submissions coming from 25 countries. The papers are organized in topical sections on logic and foundations, induction and logic programming, reinforcement learning, machine learning, knowledge discovery, Bayesian networks, beliefs and intentions in agents, autonomous agents, agent systems, genetic algorithms, genetic programming, constraint satisfaction, neural networks, Markov decision processes, robotics, image processing and pattern recognition, natural language, AI in web technology, intelligent systems, and AI and music.

This book presents selected tutorial lectures given at the summer school on Multi-Agent Systems and Their Applications held in Prague, Czech Republic, in July 2001 under the sponsorship of ECCAI and Agent Link. The 20 lectures by leading researchers in the field presented in the book give a competent state-of-the-art account of research and development in the field of multi-agent systems and advanced applications. The book offers parts on foundations of MAS; social behaviour, meta-reasoning, and learning; and applications.

Building research grade multi-agent systems usually involves a broad variety of software infrastructure ingredients like planning, scheduling, coordination, communication, transport, simulation, and module integration technologies and as such constitutes a great challenge to the individual researcher active in the area. The book presents a collection of papers on approaches that will help make deployed and large scale multi-agent systems a reality. The first part focuses on available infrastructure and requirements for constructing research-grade agents and multi-agent systems. The second part deals with support in infrastructure and software development methods for multi-agent systems that can directly support coordination and management of large multi-agent communities; performance analysis and scalability techniques are needed to promote deployment of multi-agent systems to professionals in software engineering and information technology.