Resolution as a famous rule of inference has played a key role in automated reasoning for
over five decades. A number of variants and refinements of resolution have been also …

The synergized dynamic contradiction separation based automated deduction theory has
provided a novel logic based automated deduction reasoning framework, which extends the …

Resolution principle proposed originally by Robinson in 1965 has dominated automated
deduction for over three decades while the current most successful automated deduction …

As a symbolic approach for computing with words, linguistic truth-valued lattice-valued
propositional logic L _ V (n * 2) P (X) LV (n× 2) P (X) can represent and handle both …

Due to the need of the logical foundation for uncertain information processing, development
of efficient automated reasoning system based on non-classical logics is always an active …

24 Y. Liu et al. assumes implication values in a general complete mathematical lattice
toward enhancing the representation of ambiguity in reasoning. This work introduces a LIA …

After extending the term" contradiction" from the traditionally defined a complementary pair
based on two clauses into a typical unsatisfiable clause set (ie, a standard contradiction …

As a continuation and extension of the established work on binary resolution at certain truth-
value level (called α-resolution), this paper introduces non-clausal multi-ary α-generalized …

The present paper focuses on a resolution-based automated reasoning theory in a lattice-
valued logic system with truth-values defined in a lattice-valued algebraic structure-lattice …