首页> 外文会议>Indian International Conference on Artificial Intelligence >Beyond Fuzzy: Parameterized Approximations of Heyting Algebras for Uncertain Knowledge
【24h】

Beyond Fuzzy: Parameterized Approximations of Heyting Algebras for Uncertain Knowledge

机译:超越模糊:不确定知识的Heyting代数的参数化近似

获取原文

摘要

We propose a parameterized framework based on a Heyting algebra and Lukasiewicz negation for modeling uncertainty for belief. We adopt a probability theory as mathematical formalism for manipulating uncertainty. An agent can express the uncertainty in her knowledge about a piece of information in the form of belief types: as a single probability, as an interval (lower and upper boundary for a probability) or as a confidence level. The probabilistic logic programs can be parameterized by different kinds of conjunctive/disjunctive "probabilistic strategies" for their rules based on residuum-implication. The underlying algebra for belief computation is a parameterized approximation of strict (without negation) Heyting (or briefly 'parameterized Heyting') algebra with a unique epistemic negation: it is a set of Lukasiewicz-style residuated lattices and extension of fuzzy logic technique to wide family of probabilistic logic programming and deductive databases. Such framework offers a clear semantics for the satisfaction relation of different probabilistic formalisms used for handling uncertainty, and is open toward the extension of logic languages for formulae with residuum-based implications also in the body of rules.
机译:我们提出了一种基于尼伦斯代数和Lukasiewicz否定的参数化框架,以建模不确定的信念。我们采用概率理论作为操纵不确定性的数学形式主义。代理商可以在她的知识中表达关于信仰类型形式的信息的知识:作为单一概率,作为间隔(概率下限和上部边界)或置信水平。概率逻辑程序可以通过不同类型的联合/析出性的“概率策略”参数化,因为基于Resideum暗示。信仰计算的底层代数是严格(没有否定)的参数化近似(或短暂地“参数化的Heyting')代数,具有独特的认知否定:这是一套Lukasiewicz型蒸丝格和宽度模糊逻辑技术的延伸概率逻辑编程和演绎数据库的家庭。此类框架提供了一种清晰的语义,可满足用于处理不确定性的不同概率形式主义的满意关系,并且在规则方面也与基于Resideum的影响的公式延伸的逻辑语言。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号