Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics

One of the obstacles against the use of tableau-based theorem provers for non-standard logics is the inefficiency of tableau systems in practical applications, though they are highly intuitive and extremely flexible from a proof theoretical point of view. We present a method for increasing the efficiency of tableau systems in the case of multiple-valued logics by introducing a generalized notion of signed formulas and give sound and complete tableau systems for arbitrary propositional finite-valued logics.

[1]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[2]  Gerhard Wilhelm Dueck.  Algorithms for the minimization of binary and multiple-valued logic functions , 1988 .

[3]  Reiner Hähnle,et al.  Spezifikation eines Theorembeweisers für dreiwertige First-Order Logik , 1990, IWBS Report.

[4]  R. Hahnle.  Uniform notation of tableau rules for multiple-valued logics , 1991, [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic.

[5]  Walter Alexandre Carnielli,et al.  Systematization of finite many-valued logics through the method of tableaux , 1987, Journal of Symbolic Logic.

[6]  R. Smullyan.  First-Order Logic , 1968 .

[7]  Ryszard Wójcicki,et al.  Theory of Logical Calculi , 1988 .

[8]  Melvin Fitting.  Negation as refutation , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[9]  Franz Oppacher,et al.  Controlling Deduction with Proof Condensation and Heuristics , 1986, CADE.

[10]  Zbigniew Stachniak,et al.  Note on resolution approximation of many-valued logics , 1990, Proceedings of the Twentieth International Symposium on Multiple-Valued Logic.

[11]  M. Fitting.  Proof Methods for Modal and Intuitionistic Logics , 1983 .

[12]  Evert W. Beth,et al.  Semantic Entailment And Formal Derivability , 1955 .

[13]  stanisław j. surma,et al.  an algorithm for axiomatizing every finite logic**The paper was presented at the International Symposium on Multiple-Valued Logic, Morgantown, West Virginia, U.S.A., May, 1974. An abstract of this paper is published in [3]. , 1977 .

[14]  Peter H. Schmitt.  Perspectives in Multi-Valued Logic , 1989, Natural Language and Logic.

[15]  Pierre Wolper,et al.  Temporal logic can be more expressive , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[16]  John C. Shepherdson,et al.  A Sound and Complete Semantics for a Version of Negation as Failure , 1989, Theor. Comput. Sci..