Contradiction separation based dynamic multi-clause synergized automated deduction
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 …
over five decades. A number of variants and refinements of resolution have been also …
Some synergized clause selection strategies for contradiction separation based automated deduction
The synergized dynamic contradiction separation based automated deduction theory has
provided a novel logic based automated deduction reasoning framework, which extends the …
provided a novel logic based automated deduction reasoning framework, which extends the …
A novel generalization of resolution principle for automated deduction
Resolution principle proposed originally by Robinson in 1965 has dominated automated
deduction for over three decades while the current most successful automated deduction …
deduction for over three decades while the current most successful automated deduction …
A unified algorithm for finding -IESFs in linguistic truth-valued lattice-valued propositional logic
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 …
propositional logic L _ V (n * 2) P (X) LV (n× 2) P (X) can represent and handle both …
Non-Clausal Multi-ary α-Generalized Resolution Calculus for a Finite Lattice-Valued Logic
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 …
of efficient automated reasoning system based on non-classical logics is always an active …
[PDF][PDF] Toward a Synergy of a Lattice Implication Algebra with Fuzzy Lattice Reasoning—A Lattice Computing Approach
Y Liu, VG Kaburlasos… - Handbook of Fuzzy …, 2016 - sciencegatepub.com
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 …
toward enhancing the representation of ambiguity in reasoning. This work introduces a LIA …
Multi-clause synergized contradiction separation based first-order theorem prover—MC-SCS
J Zhong, F Cao, G Wu, Y Xu… - 2017 12th International …, 2017 - ieeexplore.ieee.org
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 …
based on two clauses into a typical unsatisfiable clause set (ie, a standard contradiction …
NON-CLAUSAL MULTI-ARY α-GENERALIZED RESOLUTION PRINCIPLE FOR A LATTICE-VALUED PROPOSITIONAL LOGIC
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 …
value level (called α-resolution), this paper introduces non-clausal multi-ary α-generalized …
Non-clausal multi-ary alpha-generalized resolution principle for a lattice-valued first-order logic
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 …
valued logic system with truth-values defined in a lattice-valued algebraic structure-lattice …