论文信息 - Classical Resolution for Many-Valued Logics - 字舞流文

Classical Resolution for Many-Valued Logics

Cláudia Nalon | João Marcos | João Marcos | C. Nalon

[1] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[2] J. A. Robinson,et al. Automatic Deduction with Hyper-Resolution , 1983 .

[3] David A. Plaisted,et al. A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[4] Christian G. Fermüller,et al. Resolution for Many-Valued Logics , 1992, LPAR.

[5] Richard Zach,et al. Proof Theory of Finite-valued Logics , 1993 .

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

[7] Reiner Hähnle. Short Conjunctive Normal Forms in Finitely Valued Logics , 1994, J. Log. Comput..

[8] Christian G. Fermüller,et al. Automated Deduction for Many-Valued Logics , 2001, Handbook of Automated Reasoning.

[9] Walter Carnielli,et al. Suszko’s Thesis and dyadic semantics , 2003 .

[10] João Marcos,et al. Many-valuedness Meets Bivalence: Using Logical Values in an EffectiveWay , 2012, J. Multiple Valued Log. Soft Comput..

[11] Andrei Voronkov,et al. The Inverse Method for Many-Valued Logics , 2013, MICAI.

[12] Marco Volpe,et al. Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics , 2014, Theor. Comput. Sci..