Product Description: In recent years, Artificial Intelligence researchers have largely focused their efforts on solving specific problems, with less emphasis on 'the big picture' - automating large scale tasks which require human-level intelligence to undertake...read more

There are many kinds of books on formal logic. Some have philosophers as their intended audience, some mathematicians, some computer scien­ tists. Although there is a common core to all such books, they will be very different in emphasis, methods, and even appearance. This book is intended for computer scientists. But even this is not precise. Within computer science formal logic turns up in a number of areas, from pro­ gram verification to logic programming to artificial intelligence. This book is intended for computer scientists interested in automated theo­ rem proving in classical logic. To be more precise yet, it is essentially a theoretical treatment, not a how-to book, although how-to issues are not neglected. This does not mean, of course, that the book will be of no interest to philosophers or mathematicians. It does contain a thorough presentation of formal logic and many proof techniques, and as such it contains all the material one would expect to find in a course in formal logic covering completeness but, not incompleteness issues. The first item to be addressed is, What are we talking about and why are we interested in it? We are primarily talking about truth as used in mathematical discourse, and our interest in it is, or should be, self­ evident. Truth is a semantic concept, so we begin with models and their properties. These are used to define our subject.

Extensional Constructs in Intensional Type Theory presents a novel approach to the treatment of equality in Martin-Loef type theory (a basis for important work in mechanised mathematics and program verification). Martin Hofmann attempts to reconcile the two different ways that type theories deal with identity types. The book will be of interest particularly to researchers with mainly theoretical interests and implementors of type theory based proof assistants, and also fourth year undergraduates who will find it useful as part of an advanced course on type theory.

Product Description: The History of the Book In August 1992 the author had the opportunity to give a course on resolution theorem proving at the Summer School for Logic, Language, and Information in Essex. The challenge of this course (a total of five two-hour lectures) con­ sisted in the selection of the topics to be presented...read more

Product Description: Four goals of the book: Offer a tutorial on mathematical ideas which underlie our research Serve as a manual for users of the Nuprl system Give an overview of the project for those interested in applications of the results and for those inclined to basic research in the area Present research which has arisen as we have worked on the Nuprl system...read more

Product Description: The world of betting is changing dramatically - say hello to Binary Betting.In recent years betting on sporting events and the trading of financial markets have been moving closer to each other, and binary bets are the result of this convergence...read more

Product Description: The automation of mathematical reasoning has been an important topic of research almost since computers were invented. The new technique of rippling, described here for the first time in book form, is designed to be an approach to mathematical reasoning that takes into account ideas of heuristics and searching...read more

Product Description: By presenting state-of-the-art results in logical reasoning and formal methods in the context of artificial intelligence and AI applications, this book commemorates the 60th birthday of Jörg H. Siekmann. The 30 revised reviewed papers are written by former and current students and colleagues of Jörg Siekmann; also included is an appraisal of the scientific career of Jörg Siekmann entitled "A Portrait of a Scientist: Logics, AI, and Politics...read more

Product Description: On the history of the book: In the early 1990s several new methods and perspectives in au- mated deduction emerged. We just mention the superposition calculus, meta-term inference and schematization, deductive decision procedures, and automated model building...read more

Alan Robinson This set of essays pays tribute to Bob Kowalski on his 60th birthday, an anniversary which gives his friends and colleagues an excuse to celebrate his career as an original thinker, a charismatic communicator, and a forceful intellectual leader. The logic programming community hereby and herein conveys its respect and thanks to him for his pivotal role in creating and fostering the conceptual paradigm which is its raison d’Œtre. The diversity of interests covered here reflects the variety of Bob’s concerns. Read on. It is an intellectual feast. Before you begin, permit me to send him a brief personal, but public, message: Bob, how right you were, and how wrong I was. I should explain. When Bob arrived in Edinburgh in 1967 resolution was as yet fairly new, having taken several years to become at all widely known. Research groups to investigate various aspects of resolution sprang up at several institutions, the one organized by Bernard Meltzer at Edinburgh University being among the first. For the half-dozen years that Bob was a leading member of Bernard’s group, I was a frequent visitor to it, and I saw a lot of him. We had many discussions about logic, computation, and language. (view table of contents)

(view table of contents)

(view table of contents)

Product Description: The last twenty years have witnessed an accelerated development of pure and ap­ plied logic, particularly in response to the urgent needs of computer science. Many traditional logicians have developed interest in applications and in parallel a new generation of researchers in logic has arisen from the computer science community...read more

Product Description: Approach your problems from the right end It isn't that they can't see the solution. It is and begin with the answers. Then one day, that they can't see the problem. perhaps you will find the final question. G. K. Chesterton. The Scandal of Father 'The Hermit Clad in Crane Feathers' in R...read more

Product Description: Mathematicians at every level use diagrams to prove theorems. Mathematical Reasoning with Diagrams investigates the possibilities of mechanizing this sort of diagrammatic reasoning in a formal computer proof system, even offering a semi-automatic formal proof system—called Diamond—which allows users to prove arithmetical theorems using diagrams...read more (view table of contents, read Amazon.com's description)

(view table of contents)

Product Description: Growing demands for the quality, safety, and security of software can only be satisfied by the rigorous application of formal methods during software design. This book methodically investigates the potential of first-order logic automated theorem provers for applications in software engineering...read more (view table of contents, read Amazon.com's description)