This book updates the thesis I produced for my PhD at the Department of Artificial Intelligence of the University of Edinburgh, correcting errors, and improving some of the formatting and readability. Since the original work was completed (early 1996), research has progressed. Most notably, the public profile of AI and game-playing has reached new heights with the feats of the chess computer DEEPER BLUE (which surely uses AI, no matter what IBM would have us believe). Although less heralded, the ability of computers to play Bridge (the main example domain in this book) has also increased. In July of 1997 a world championship for computer Bridge programs was hosted by the American Contract Bridge League in Albuquerque, New Mex ico. This contest was won by a program called Bridge Baron, produced by Great Game Products. Bridge Baron incorporates knowledge-based planning techniques developed by Stephen Smith and Dana Nau [1, 2]. Progress has also been made on the contrasting, more brute-force, approach of sampling the possible card distributions. In particular, Matt Ginsberg has developed a fast double-dummy solver based on partition search [3]. Ginsberg's program fared poorly in the 1997 Bridge championships, but Ginsberg himself reports very promising results [4] on a hard set of complete Bridge deals taken from the Bridge tutoring program Bridge Master.

This book constitutes the strictly refereed post-proceedings of the First International Conference on Computer and Games, CG'98, held in Tsukuba, Japan in November 1998. The 21 revised full papers presented were carefully selected after two rounds of reviewing from a total of 35 submissions. The book addresses all aspects of computers and games, including game playing programs, mathematical games learning algorithms, social and cognitive aspects, and game theory. The papers are organized in topical sections on search and strategies, learning and pattern acquisition theory, and Go, Tsume-Shogi, and Heian-Shogi.

This book constitutes the refereed proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2004, held in Fort Lauderdale, Florida, USA in January 2004. The 24 revised full papers presented together with 8 system descriptions were carefully reviewed and selected for presentation. Among the topics addressed are declarative logic programming, nonmonotonic reasoning, knowledge representation, combinatorial search, answer set programming, constraint programming, deduction in ontologies, and planning.

This book constitutes the refereed proceedings of the European Conference on Logics in Artificial Intelligence, JELIA 2002, held in Cosenza, Italy in September 2002.The 41 revised full papers presented together with 11 system descriptions and 3 invited contributions were carefuly reviewed and selected from more than 100 submissions. The papers are organized in topical sections on multi-agent systems, evolution and changes, description logic and the semantic web, complexity issues, probabilistic logic, AI planning, modal logic and causal reasoning, theory, reasoning under uncertainty, satisfiability, paraconsisten reasoning, actions and caution, logic for agents, semantics, and optimization issues in answer set semantics.

This volume contains the contributions to the Joint German/Austrian Con- rence on Arti?cial Intelligence, KI 2001, which comprises the 24th German and the 9th Austrian Conference on Arti?cial Intelligence. They are divided into the following categories: – 2 contributions by invited speakers of the conference; – 29 accepted technical papers, of which 5 where submitted as application papers and 24 as papers on foundations of AI; – 4 contributions by participants of the industrial day, during which companies working in the ?eld presented their AI applications. After a long period of separate meetings, the German and Austrian Societies ̈ for Arti?cial Intelligence, KI and OGAI, decided to hold a joint conference in Vienna in 2001. The two societies had previously held one joint conference. This took place in Ottstein, a small town in Lower Austria, in 1986. At that time, the rise of expert system technology had also renewed interest in AI in general, with quite some expectations for future advances regarding the use of AI techniques in applications pervading many areas of our daily life. Since then ?fteen years have passed, and we may want to comment, at the beginning of a newcentury, on the progress that has been made in this direction.

Answer set programming (ASP) is a programming methodology oriented towards combinatorial search problems. In such a problem, the goal is to find a solution among a large but finite number of possibilities. The idea of ASP came from research on artificial intelligence and computational logic. ASP is a form of declarative programming: an ASP program describes what is counted as a solution to the problem, but does not specify an algorithm for solving it. Search is performed by sophisticated software systems called answer set solvers. Combinatorial search problems often arise in science and technology, and ASP has found applications in diverse areas—in historical linguistic, in bioinformatics, in robotics, in space exploration, in oil and gas industry, and many others. The importance of this programming method was recognized by the Association for the Advancement of Artificial Intelligence in 2016, when AI Magazine published a special issue on answer set programming. The book introduces the reader to the theory and practice of ASP. It describes the input language of the answer set solver CLINGO, which was designed at the University of Potsdam in Germany and is used today by ASP programmers in many countries. It includes numerous examples of ASP programs and present the mathematical theory that ASP is based on. There are many exercises with complete solutions.

Humans are often distinguished from other animals by their ability, even need, to see patterns in everyday life. As we enter a new millennium, all aspects of society seem to want to take stock of what has happened in the past and what is likely to happen in the future.The computer industry is no different from others. Advances in Computers has been published continuously since 1960 and this year's volume is the fiftieth technical volume in the series (two index volumes were published as volumes 50 and 51). Since it is the fortieth year of publication, we decided to look back on the changes that have occurred since Volume 1 of Advances in computers appeared in 1960.We looked at the six chapters of that initial volume and decided that an appropriate anniversary volume for this series would be a collection of papers on the same topics that appeared in 1960. What has happened to those technologies? Are we making the progress we thought we would or are events moving more slowly? - Business computing - Numerical weather prediction - Spoken language - Language understanding - Microprocessor design - Computer games