Искусственный интеллект
Информатика и вычислительная техника
  • формат pdf
  • размер 1.35 МБ
  • добавлен 17 ноября 2011 г.
Baumgartner P. Theory Reasoning in Connection Calculi
Издательство Springer, 1998, -289 pp.

Certainly, the ability to draw inferences is a central operation in any Artificial Intelligence (AI) system. Consequently, automated deduction is one of the most traditional disciplines in AI. One core technique, the resolution principle [Robinson, 1965b] nowadays even seems to be standard knowledge for any computer scientist.
Although resolution is particularly well suited for implementation on a computer, it became clear soon after its invention that even more elaborate techniques are needed to cope with the tremendous search space. One of these techniques is theory reasoning, where the idea is to incorporate specialized and efficient modules for handling general domain knowledge into automated reasoning. These theory reasoning modules might, for instance, simplify a goal, compute solutions, look up facts in a database, etc. Also, the most suitable knowledge representation formalism might be used for this.
This book is on extensions of calculi for automated theorem proving to- ward theory reasoning. It focuses on connection methods and in particular on model elimination. An emphasis lies on the combination of such calculi with theory reasoners to be obtained by a new compilation approach.
Several theory-reasoning versions of connection calculi are defined and related to each other. In doing so, theory model elimination (TME) will be selected as a base to be developed further. The final versions are search-space restricted versions of total TME, partial TME, and partial restart TME. These versions all are answer-complete, thus making TME interesting for logic programming and problem-solving applications.
A theory reasoning system is only operable in combination with an (efficient) background reasoner for the theories of interest. Instead of hand- crafting respective background reasoners, a more general approach - linearizing completion - is proposed. Linearizing completion enables the automatic construction of background calculi suitable for TME-based theory reasoning systems from a wide range of axiomatically given theories, namely Ho theories.
Technically, linearizing completion is a device for combining the unit- resulting strategy of resolution with a goal-oriented, linear strategy as in Prolog in a refutationally complete way.
Finally, an implementation extending the PTTP technique (Prolog based Technology Theorem Proving) toward theory reasoning is described, and the usefulness of the methods developed in this text will be experimentally demonstrated.
This book was written during my employment1 as a research assistant at the institute for computer science at the University of Koblenz-Landau in Germany. It is the revised version of a doctoral dissertation submitted and accepted at this institute.

Introduction
Logical Background
Tableau Model Elimination
Theory Reasoning in Connection Calculi
Linearizing Completion
Implementation
Conclusions
A. Proofs
B. What is Where?
Читать онлайн
Похожие разделы
Смотрите также

David J.C. MacKay, Information Theory, Inference, and Learning Algorithms

  • формат pdf
  • размер 11.13 МБ
  • добавлен 17 марта 2011 г.
This book is aimed at senior undergraduates and graduate students in Engineering, Science, Mathematics, and Computing. It expects familiarity with calculus, probability theory, and linear algebra as taught in a rst- or secondyear undergraduate course on mathematics for scientists and engineers.

Hunter A., Parsons S. (eds.) Applications of Uncertainty Formalisms

  • формат djvu
  • размер 3.44 МБ
  • добавлен 27 декабря 2011 г.
Издательство Springer, 1998, -480 pp. Managing uncertainty is one of the key questions in a diverse range of areas in computing. Many researchers in both universities and commercial organizations are seeking better information on applying uncertainty formalisms. There is a particular need for analyses comparing and contrasting different approaches to uncertainty formalisms and we hope that the papers in this book help to fill this need. The pap...

Lenz M., Bartsch-Sp?rl B., Burkhard H.-D., Wess S. (eds.) Case-Based Reasoning Technology. From Foundations to Applications

  • формат pdf
  • размер 2.95 МБ
  • добавлен 15 декабря 2011 г.
Издательство Springer, 1998, -414 pp. Broadly speaking, case-based reasoning (CBR) is concerned with solving new problems by adapting solutions that worked for similar problems in the past. As with Artificial Intelligence in general, case-based reasoning deals with two different aspects of intelligence: A first motivation is to establish cognitive models in order to understand human thinking and behavior. A second motivation is to build systems...

Meyer J.-J.C., van der Hoek W. Epistemic Logic for AI and Computer Science

  • формат djvu
  • размер 1.76 МБ
  • добавлен 08 февраля 2012 г.
Издательство Cambridge University Press, 1995, -368 pp. Epistemic logic concerns the notions knowledge and belief ('???????? — episteme — is Greek for 'knowledge'), and stems from philosophy where it has been developed to give a formal treatment of these notions. (Sometimes the logic of belief is separately referred to as doxastic logic, from the Greek word ????— doxa —, meaning 'surmise' or 'presumption'. In this book we shall use epistemic log...

Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference

  • формат pdf
  • размер 20.8 МБ
  • добавлен 15 января 2011 г.
Morgan Kaufmann, 1988. - 552 pages. Probabilistic Reasoning in Intelligent Systems is a complete and accessible account of the theoretical foundations and computational methods that underlie plausible reasoning under uncertainty. The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, t...

Tim Jones M. Al Application Programming (на английском) + Исходный код всех примеров из книги

  • формат txt, chm, rtf
  • размер 8.06 МБ
  • добавлен 30 марта 2010 г.
The purpose of this book is to demystify the techniques associated with the field of artificial intelligence. It covers both the theory and the practical applications to teach developers how to apply AI techniques in their own designs. Эта книга на русском языке

Van Harmelen F., Lifschitz V., Porter B. Handbook of Knowledge Representation

Справочник
  • формат pdf
  • размер 10.96 МБ
  • добавлен 06 января 2012 г.
Издательство Elsevier, 2008, -1035 pp. Knowledge Representation and Reasoning is at the heart of the great challenge of Artificial Intelligence: to understand the nature of intelligence and cognition so well that computers can be made to exhibit human-like abilities. As early as 1958, John McCarthy contemplated Artificial Intelligence systems that could exercise common sense. From this and other early work, researchers gained the conviction that...

Wang C., Hill D.J. Deterministic Learning Theory for Identification, Recognition and Control

  • формат pdf
  • размер 10.94 МБ
  • добавлен 29 ноября 2011 г.
Издательство CRC Press, 2010, -218 pp. The problem of learning in dynamic environments is important and challenging. In the 1960s, learning from control of dynamical systems was studied extensively. At that time, learning was similar in meaning to other terms such as adaptation and self-organizing. Since the 1970s, learning theory has become a research discipline in the context of machine learning, and more recently as computational or statistic...