|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | The sound and complete R-calculus for revising propositional theories显示文摘The AGM postulates are for the belief revision(revision by a single belief), and the DP postulates for the iterated revision(revision by a finite sequence of beliefs). Li gave an R-calculus for R-configurations?|Γ,where ? is a set of atomic formulas or the negations of atomic formulas, and Γ is a finite set of formulas. In this paper, two deduction systems for the revision of a theory by another theory are given such that the systems are sound and complete, that is, if ?|Γ■Γ′ is provable then Γ′■ ? is consistent and Γ′- ? is a maximal subset of Γ such that(Γ′- ?) ∪ ? is consistent; and for any finite theories ? and Γ, there is a finite theoryΓ′ such that Γ′- ? is a maximal subset of Γ such that(Γ′- ?) ∪ ? is consistent, and ?|Γ ? Γ′ is provable.Moreover, if?|Γ■Γ′ is provable then Γ′ satisfies the AGM and the DP postulates. | LI Wei SUI YueFei SUN MeiYing | 2015 | Science China(Information Sciences)2015，58，9： | 2 |
| 2 | An information entropy-based approach to outlier detection in rough sets 显示文摘 | JIANG Feng SUI Yuefei CAO Cungen | 2010 | Expert Systems with Applications2010，37，9： | 1 |
| 3 | A sound and complete R-calculi with respect to contraction and minimal change显示文摘AGM 要求为信仰修订(由一个单个信仰的修订) ,并且 DP 要求为重申的修订(由信仰的一个有限序列的修订) 。, R 演算为 R 配置 | 被给是一套原子公式或原子公式的否定,并且是公式的一个有限集合。我们将给二 R 演算 C 和 M (推理规则的集合) 以便在命题逻辑的公式,为任何有限一致集合有公式的一个一致集合以便|,是可证明的并且是收缩由或一个最小的变化由;并且证明 C 和 M 分别地关于收缩和最小的变化健全、完全。 | Wei LI Yuefei SUI | 2014 | Frontiers of Computer Science2014，8，2： | 1 |
| 4 | An information entro- py-based approach to outlier detection in rough sets 显示文摘 | Jiang Feng Sui Yuefei Cao Cungen | 2010 | Expert Syst App12010，37，1： | 1 |
| 5 | An information entropy- based approach to outlier detection in rough sets显示文摘 | Jiang Feng Sui Yuefei Cao Cungen | 2010 | Expert Systems with Applications2010，37，9： | 1 |
| 6 | Decomposition for a new kind of imprecise information system显示文摘 | Shaobo DENG Sujie GUAN Min LI Lei WANG Yuefei SUI | 2018 | Frontiers of Computer Science2018，12，2： | 1 |
| 7 | A rough set approach to outlier detection显示文摘 | Jiang Feng Sui Yuefei Cao Cungen | 2008 | Int Journal of General Systems2008，37，5： | 1 |
| 8 | An information en- tropy-based approach to outlier detection in rough sets 显示文摘 | JIANG FENG SUI YUEFEI CAO CUNGEN | 2010 | Expert Systems with Applications2010，1，37： | 1 |
| 9 | An information entropy-based approach to outlier detection in rough sets 显示文摘 | JIANG FENG SUI YUEFEI CAO CUNGEN | 2010 | Ex- pert Systems with Applications2010，37，10： | 1 |
| 10 | The correspondence between the concepts in description logics for contexts and formal concept analysis显示文摘Formal concept analysis (FCA) and description logic (DL) are meant to be formalizations of concepts.A formal concept in the former consists of its intent and extent,where the intent is the set of all the attributes shared by each object in the extent of the concept,and the extent is the set of all the objects sharing each property in the intent of the concept.A concept in the latter formalization is simply a concept name,the interpretation of which is a subset of a universe.To consider the correspondence between concepts in both formalizations,a multi-valued formal context must be represented both as a knowledge base and as a model of the DL for contexts,where concepts are decomposed into tuple concepts C,interpreted as a set of tuples and value concepts V,interpreted as a set of attribute-value pairs.We show that there is a difference between the interpretation of concepts R.V /R.C and the Galois connection between the extent/intent of formal concepts in FCA.According to the Galois connection,there should be concepts of the form + R.V and + R.C inter-preted in FCA,and hence the logical language L for DL is extended to be L + together with + as a constructor so that + R.V and + R.C are well-defined concepts.Conversely,according to the interpretation in DL there should be pseudo concepts in FCA so that the interpretation of concepts R.V /R.C is the extent/intent of pseudo concepts.The correspondence between formal concepts and concepts in L +,and between pseudo concepts and concepts in L are presented in this paper. | MA Yue SUI YueFei CAO CunGen | 2012 | Science China(Information Sciences)2012，55，5： | 1 |
| 11 | Some issues about outlier detection in rough set theory显示文摘 | Feng Jiang Yuefei Sui Cungen Cao | 2009 | Expert Systems with Applications2009，36，3： | 1 |
| 12 | Relational opera- tions and uncertainty measure in rough relational data- base显示文摘 | Jiang Feng Wan Xiaoyan Sui Yuefei | 2013 | Fundamenta Informaticae2013，123，4： | 1 |
| 13 | Contrary description logic: Gentzen deduction system显示文摘Traditional description logics are based on complementary rather than contrary concepts. This work proposes a contrary description logic based on the contrary concept constructors ~, ?(instead of ?).A Gentzen-type deduction system is applied to make the system sound and complete with the three-valued semantics of contrary description logic. | Wei LI Yuefei SUI Jie LUO Bo CHEN | 2017 | Science China(Information Sciences)2017，60，11： | 0 |
| 14 | The B4-valued propositional logic with unary logical connectives ~1 /~2/┐显示文摘 | Wei LI Yuefei SUI | 2017 | Frontiers of Computer Science2017，11，5： | 0 |
| 15 | Variant quantifiers in L_(3)-valued first-order logic显示文摘Traditional first-order logic has four definitions for quantifiers,which are defined by universal and existential quantifiers.In L_(3)-valued(three-valued)first-order logic,there are eight kinds of definitions for quantifiers;and corresponding Gentzen deduction systems will be given and their soundness and completeness theorems will be proved. | Wei LI Yuefei SUI | 2021 | Frontiers of Computer Science2021，15，5： | 0 |
| 16 | Monotonic and nonmonotonic gentzen deduction systems for L_(3)-valued propositional logic显示文摘A sequent is a pair(Г,△),which is true under an as-signment if either some formula inГis false,or some formula in △ is true.In L3-valued propositional logic,a mulisequent is a triple △|Θ|Г,which is true under an assignment if either some formula in △ has truth-value t,or some formula in Θ has truth-value m,or some formula in Г has truth-value￡.Corre-spondingly there is a sound and complete Gentzen deduction system G for multisequents which is monotonic.Dually,a CO-multisequent is a triple △:Θ:Г,which is valid if there is an assignment v in which each formula in△has truth-value≠t,each formula in Θ has truth-value≠m,and each formula in Г has truth-value≠￡.Correspondingly there is a sound and com-plete Gentzen deduction system G-for co-multisequents which is nonmonotonic. | Cungen CAO Lanxi HU Yuefei SUI | 2021 | Frontiers of Computer Science2021，15，3： | 0 |
| 17 | Nonmonotonic propositional logic显示文摘Propositional logic[1]is basic,based on which other logics are developed.The deduction system for propositional logic is monotonic.Nonmonotonic logics are a class of logics which deduction systems are nonmonotonic.Typical ones are default logic[2,3],R-calculus[4],autoepistemic logic[5],circumscription[5],etc. | Wei LI Yuefei SUI Yuhui WANG | 2021 | Frontiers of Computer Science2021，15，3： | 0 |
| 18 | The M-computations induced by accessibility relations in nonstandard models M of Hoare logic显示文摘 | Cungen CAO Yuefei SUI Zaiyue ZHANG | 2016 | Frontiers of Computer Science2016，10，4： | 0 |
| 19 | A computational framework for Karl Popper's logic of scientific discovery显示文摘Belief revision is both a philosophical and logical problem. From Popper's logic of scientific discovery, we know that revision is ubiquitous in physics and other sciences. The AGM postulates and Rcalculus are approaches from logic, where the R-calculus is a Gentzen-type concrete belief revision operator.Because deduction is undecidable in first-order logic, we apply approximate deduction to derive an R-calculus that is computational and has finite injury. We further develop approximation algorithms for SAT problems to derive a feasible R-calculus based on the relation between deduction and satisfiability. In this manner, we provide a full spectrum of belief revision: from philosophical to feasible revision. | Wei LI Yuefei SUI | 2018 | Science China(Information Sciences)2018，61，4： | 0 |
| 20 | Monotonicity and nonmonotonicity in L3-valued propositional logic显示文摘A sequent is a pair (Γ, Δ), which is true under an assignment if either some formula in Γ is false, or some formula in Δ is true. In L_(3)-valued propositional logic, a multisequent is a triple Δ∣Θ∣Γ, which is true under an assignment if either some formula in Δ has truth-value t, or some formula in Θ has truth-value m, or some formula in Γ has truth-value f. There is a sound, complete and monotonic Gentzen deduction system G for sequents. Dually, there is a sound, complete and nonmonotonic Gentzen deduction system G′ for co-sequents Δ: Θ: Γ. By taking different quantifiers some or every, there are 8 kinds of definitions of validity of multisequent Δ∣Θ∣Γ and 8 kinds of definitions of validity of co-multisequent Δ: Θ: Γ, and correspondingly there are 8 sound and complete Gentzen deduction systems for sequents and 8 sound and complete Gentzen deduction systems for co-sequents. Correspondingly their monotonicity is discussed. | Wei Li Yuefei Sui | 2022 | Frontiers of Computer Science2022，16，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员