This book constitutes a self-contained and unified approach to automated reasoning in multiple-valued logics (MVL). It is the first overview of this area, and it contains a virtually complete account of other approaches to automated reasoning in MVL. Efficient theorem proving methods in MVL are essential for many applications, however existing approaches are inadequate. Here, the author shows how automated reasoning in infinitely valued logics can be done uniformly and efficiently for the first time. Automated reasoning in non-classical logics is a key subtask of many artificial intelligence operations. Applications of MVL in particular include hardware and software verification, reasoning with incomplete or inconsistent knowledge, and natural language processing. The book will thus be a valuable resource for theoretical computer scientists, researchers, and graduate students, as well as for logicians.More precisely, we have that $(alt;jagt;Vip) iff (i alt;jagt; and Qtp) or (* alt;jagt; and i ip) or (0 0 and i ip). Transforming this into a tableau rule, we obtain ... normal forms of their premisses. Using the same method one can compute rules for all combinations of anbsp;...
|Title||:||Automated Deduction in Multiple-Valued Logics|
|Publisher||:||Oxford University Press on Demand - 1993|