Improving tableau deductions in multiple-valued logics

Abstract

Path dissolution is an efficient generalization of the method of analytic tableaux. Both methods feature (in the propositional case) strong completeness, the lack of reliance upon conjunctive normal form (CNF), and the ability to produce a list of essential models (satisfying interpretations) of a formula. Dissolution can speed up every step in a tableau deduction in classical logic. The authors consider means for adapting both techniques to multiple-valued logics, and show that the speed-up theorem applies in this more general setting. These results are pertinent for modeling uncertainty and commonsense reasoning.<>