Automated deduction in multiple-valued logics
Author(s)
Bibliographic Information
Automated deduction in multiple-valued logics
(International series of monographs on computer science, 10)
Clarendon Press , Oxford University Press, 1993
Available at 16 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. [156]-168) and index
Description and Table of Contents
Description
This book constitutes a self-contained and unified approach to automated reasoning in multiple-valued logics (MVL) developed by the author. Moreover, it contains a virtually complete account of other approaches to automated reasoning in MVL. This is the first overview of this subfield of automated reasoning ever given. Finally, a variety of applications of automated reasoning in MVL including several short case studies are listed.
Automated reasoning in non-classical logics is an essential subtask of many AI applications. Applications of MVL in particular include, for instance, hardware and software verification, reasoning with incomplete or inconsistent knowledge, and natural language processing.
Therefore, efficient theorem proving methods in MVL are essential. In the historical part of the book it is demonstrated why existing approaches are inadequate. In the original part a simple, but powerful, concept called 'sets-as-signs' is introduced in the context of semantic tableaux, and subsequently is applied to a variety of calculi including resolution and dissolution. It is shown that 'sets-as-signs' yields a many-valued extension of the well-known relationship between classical logic
and integer programming. As a consequence, automated reasoning in infinitely-valued logics can be done uniformly and efficiently for the first time.
Table of Contents
- 1. Introduction
- 2. Preliminaries
- 3. The logical basis: Signed analytical tableaux
- 4. A new technique: Truth value sets as signs
- 5. Uniform notation regained: Regular logics
- 6. Beyond tableaux
- 7. Applications
- 8. A history of multiple-valued theorem proving
- 9. Conclusions
- References
- Index
by "Nielsen BookData"