reasoning schemes in the framework of lattice-valued logic with truth-values in a lattice algebraic structure-lattice implication algebras (LIA), this paper is focused on investigating α-n(t)-ary resolution dynamic automated reasoning method in lattice-valued propositional logic LP(X) based in LIA...
lattice-valued logicα-resolutionlattice-valued Horn g-clauselattice implication algebraIn this paper, anα-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic systemL P(X) based on lattice implication algebra. Firstly, the ...
He XX, Liu J, Xu Y, Chen SW (2012a) \(\alpha \) -Generalized lock resolution method in linguistic truth-valued lattice-valued logic. Int J Comput Intell Syst 5(6):1120–1134α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic[J] . Xingxing He,Yang Xu...
The second method is the method of extension, introduced by Tsejtin [1968], which involves introducing new propositional variables in addition to the variables occurring in the formula A. The new propositional variables are called extension variables and allow each distinct subformula B in A to ...
including description logics, and a certain kind of first-order resolution method. This simulation by resolution has a number of fundamental consequences. It provides valuable insight into the similarities and differences of resolution and tableau methods. Since for the present day modal logic ...
resolution refutation is method of finding whether the given antecedent implies the consequent or not, it could also be used to check validity of the expressions. resolution logic prolog logic-programming propositional-logic validity tautology resolution-proof refutation-resolution propositional-proof-system...
For this reason, all present lower bounds for QBF proof systems — except for recent results proven by the new strategy extraction method [8], [10] and feasible interpolation [11]— are either shown ad hoc1 or are obtained by lifting known classical lower bounds or previous QBF bounds (e...
Reconciling requirements: a method for managing interference, inconsistency and conflict. Annals of Software Engineer- ing, 3(1):433–457, 1997. 54. Ryoji Tanabe and Hisao Ishibuchi. An analysis of quality indicators using approxi- mated optimal distributions in a 3-d objective space. IEEE ...
1. Method of resolution under predicate logic; 谓词逻辑描述下的归结推理方法2) resolution rule of inference 推理的归结规则3) resolution automated reasoning 归结自动推理 1. In order to improve the efficiency of resolution automated reasoning algorithm in lattice-valued propositional logic, II-α-...
Method of resolution under predicate logic; 谓词逻辑描述下的归结推理方法3) Automated Reasoning 自动推理 1. Expression Reasoning in Automated Reasoning; 平面几何中复杂表达式的自动推理 2. Interactive system of mathematical Web services based on AJAX and automated reasoning technologies; 基于AJAX和自动...