论文信息 - Multiple-Valued Tableaux with ∆-reductions

Multiple-Valued Tableaux with ∆-reductions

We introduce the reduced signed logics which generalize previous approaches to signed logics in the sense that each variable is allowed to have its own set of semantic values. Reductions on both signed logics and signed formulas are used to describe improvements in tableau provers for MVLs. A labelled deductive system allows to use the implicit information in the formulas to describe improved expansion rules based on these reductions.

[1] Wolfgang Bibel,et al. Issues in Theorem Proving Based on the Connection Method , 1995, TABLEAUX.

[2] Bernhard Beckert,et al. Simplification of Many-Valued Logic Formulas Using Anti-Links , 1998, J. Log. Comput..

[3] Manuel Ojeda-Aciego,et al. Implicates and Reduction Techniques for Temporal Logics , 1998, JELIA.

[4] Klaus Mayr. Link Deletion in Model Elimination , 1995, TABLEAUX.

[5] Reiner Hähnle,et al. Automated deduction in multiple-valued logics , 1993, International series of monographs on computer science.

[6] Manuel Ojeda-Aciego,et al. Increasing the efficiency of automated theorem proving , 1995, J. Appl. Non Class. Logics.

[7] Manuel Ojeda-Aciego,et al. Reducing signed propositional formulas , 1999, Soft Comput..