首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 203 毫秒
1.
认识逻辑(2):多认识主体的认识逻辑MEL   总被引:3,自引:2,他引:3  
认识逻辑EL给出了知识和信念在单一认识主体情形下的逻辑框架。本文将认识逻辑EL推广到多认识主体的情形,得到了一个可靠并且完备的系统MEL。MEL继承了EL的全部性质。MEL的一个重要特点是各个认识主体的知识是可以共享的。MEL可以作为分布式多agent系统的逻辑基础。  相似文献   

2.
Agent-BDI逻辑   总被引:20,自引:4,他引:16  
胡山立  石纯一 《软件学报》2000,11(10):1353-1360
阐述了Agent的形式化描述应该采用含有正规和非正规模态算子的混合模态逻辑为逻辑工具 的观点.建立了Agent-BDI逻辑的代表系统A-BI,讨论了它的语法和语义.特别是给出了非正 规模态算子基于Kripke标准可能世界的新的语义解释,证明了A-BI逻辑系统不但是可靠的, 而且是完备的.A-BI逻辑系统恰当地刻画了信念与意图的本质与内在联系,可作为Agent形式 化研究的逻辑工具.  相似文献   

3.
在信念逻辑基础上,引入概率,给出了一种概率信念逻辑PBL,增强了信念逻辑的表述能力和推理能力。并为PBL建立了两种语义:首先将知识逻辑的Aumann语义进行推广,给出了PBL逻辑的概率Aumann语义,其次为PBL建立了一种正规概率模态语义,这是一种适于刻画概率模态逻辑的语义模型。证明了PBL的概率Aumann语义和正规概率模记语义的可靠性,并讨论了正规概率模态语义与Kripke语义的关系。最后,通过一个例子说明了PBL的描述能力和推理能力。  相似文献   

4.
本文提出一种对安全协议进行分析的非单调逻辑。使用知识集描述已知的断言,使用信念描述安全协议系统的默认判断,通过推理和非单调的信念维护,可以验证安全协议的安全性。  相似文献   

5.
由于传统的描述逻辑系统不适于表示不确定的、模糊的知识,本文将基于粗糙集语义的下近似和上近似引入描述逻辑系统中,使用一种简单的方法将传统描述逻辑进行扩展,介绍了粗糙描述逻辑的概念,在粗糙描述逻辑系统中我们可以使用适当的子概念和超概念来对某些模糊的知识进行约束表示。本文主要讨论描述逻辑ALC的粗糙扩展,介绍扩展后所得到的粗糙描述逻辑RALC的语法、语义和相关推理问题,探讨了使用粗糙描述逻辑来对不精确概念进行建模的基本思想,最后提出了一个RALC的可满足性问题的推理算法。本文的工作可以使得在描述逻辑中对不确定的知识进行形式化描述和推理更加方便。  相似文献   

6.
本文描述了一种基于PROLOG的专家系统建造工具库PTES的实验系统。PTES是用PROLOG编写的,该系统根据支持基于规则的知识表示及近似推理对PROLOG的知识处理能力进行了扩充。PTES的推理机制使用了可能性能逻辑及模糊集合理论作为其逻辑基础,并以一种形式化的方法提供了处理非确定事实及非确定规则的能力。  相似文献   

7.
本文描述了一基于PROLOG的专家系统建造工具库PTES的实验系统。PTES是用PROLOG编写的,该系统根据支持基于规则的知识表示及近似推理对PROLOG的知识处理能力进行了扩充。PTES的推理机制使用了可能性逻辑及模糊集合理论作为其逻辑基础并以一种形式化的方法提供了处理非确定事实及非确定规则的能力。  相似文献   

8.
将知识、信念和肯定性逻辑从单个智能体扩展到多智能体系统,并且实现了多智能体系统中知识、信念和肯定性逻辑与具有并发动态属性的行为之间的很好结合.以此为基础,提出了多智能体系统中并发动态知识、信念和肯定性逻辑,简称CDKBC逻辑.为了对CDKBC逻辑进行解释,也给出了CDKBC模型,并且讨论了知识、信念和肯定性之间的关系,即知识蕴涵着肯定性,肯定性蕴涵着信念.文中也给出了一个相应的证明系统(即公理系统),证明了该系统是可靠的和完备的,并且证明了系统的有效性问题是EXPTIME完全的.最后论文给出了CDKBC逻辑的实例.  相似文献   

9.
描述逻辑综述   总被引:12,自引:2,他引:12  
石莲  孙吉贵 《计算机科学》2006,33(1):194-197
描述逻辑是一种知识表示的形式化语言,是一阶逻辑的可判定子集。作为一种知识表示的有效机制,描述逻辑被广泛地应用到计算机科学的许多领域中。本文对目前描述逻辑的研究与应用现状进行了综述性的介绍,并且从描述逻辑的定义、描述逻辑的基本语法及语义、体系结构以及描述逻辑在语义Web中的地位等方面做了系统阐述。  相似文献   

10.
BDI模型信念特性研究   总被引:6,自引:0,他引:6  
Agent计算的典型模型是BDI(belief,desire,intention),信念是Agent计算的重要属性.把信念拓展为知识性信念和可实现信念.Agent的知识性信念是指Agent当前具有或掌握的知识,具有知识的进化和继承特性.Agent的可实现信念是指当前不成立而在将来会成立的事情,是Agent被意识到的个性倾向和目标.用非标准世界的模态逻辑为形式化工具描述两种信念,将可能世界的可达关系作为认识的不同阶段和达到可实现信念的不同阶段,避免了“逻辑全知问题”和逻辑蕴涵的副作用问题.可实现信念满足KD公理,知识性信念满足KDT4公理.两种信念适合描述Agent的意识状态和意识模型.  相似文献   

11.
The starting point of this work is the gap between two distinct traditions in information engineering: knowledge representation and data-driven modelling. The first tradition emphasizes logic as a tool for representing beliefs held by an agent. The second tradition claims that the main source of knowledge is made of observed data, and generally does not use logic as a modelling tool. However, the emergence of fuzzy logic has blurred the boundaries between these two traditions by putting forward fuzzy rules as a Janus-faced tool that may represent knowledge, as well as approximate non-linear functions representing data. This paper lays bare logical foundations of data-driven reasoning whereby a set of formulas is understood as a set of observed facts rather than a set of beliefs. Several representation frameworks are considered from this point of view: classical logic, possibility theory, belief functions, epistemic logic, fuzzy rule-based systems. Mamdani's fuzzy rules are recovered as belonging to the data-driven view. In possibility theory a third set-function, different from possibility and necessity plays a key role in the data-driven view, and corresponds to a particular modality in epistemic logic. A bi-modal logic system is presented which handles both beliefs and observations, and for which a completeness theorem is given. Lastly, our results may shed new light in deontic logic and allow for a distinction between explicit and implicit permission that standard deontic modal logics do not often emphasize.  相似文献   

12.
Predicting and explaining the behavior of others in terms of mental states is indispensable for everyday life. It will be equally important for artificial agents. We present an inference system for representing and reasoning about mental states, and use it to provide a formal analysis of the false-belief task. The system allows for the representation of information about events, causation, and perceptual, doxastic, and epistemic states (vision,belief, and knowledge), incorporating ideas from the event calculus and multi-agent epistemic logic. Unlike previous AI formalisms, our focus here is on mechanized proofs and proof programmability, not on metamathematical results. Reasoning is performed via relatively cognitively plausible inference rules, and a degree of automation is achieved by generalpurpose inference methods and by a syntactic embedding of the system in first-order logic.  相似文献   

13.
Probabilistic Dynamic Epistemic Logic   总被引:5,自引:0,他引:5  
In this paper I combine the dynamic epistemic logic ofGerbrandy (1999) with the probabilistic logic of Fagin and Halpern (1994). The resultis a new probabilistic dynamic epistemic logic, a logic for reasoning aboutprobability, information, and information change that takes higher orderinformation into account. Probabilistic epistemic models are defined, and away to build them for applications is given. Semantics and a proof systemis presented and a number of examples are discussed, including the MontyHall Dilemma.  相似文献   

14.
描述逻辑是语义Web的逻辑基础,是形式化表达领域知识的工具.但是描述逻辑只能表达单调推理,不能处理不完全知识.认知描述逻辑因其非单调特性和良好的时间复杂度等特点在处理不完全知识方面有较好的优势.本文在认知描述逻辑ALCK的基础上提出了新的认知描述逻辑语言ALCKR ,保留了描述逻辑原有的优点,加入传递角色属性,增强了表达能力,并通过认知查询拥有了非单调推理的能力.设计了ALCKR 的语法、语义以及表算法.  相似文献   

15.
We propose an epistemic, nonmonotonic approach to the formalization of knowledge in a multi-agent setting. From the technical viewpoint, a family of nonmonotonic logics, based on Lifschitz's modal logic of minimal belief and negation as failure, is proposed, which allows for formalizing an agent which is able to reason about both its own knowledge and other agents' knowledge and ignorance. We define a reasoning method for such a logic and characterize the computational complexity of the major reasoning tasks in this formalism. From the practical perspective, we argue that our logical framework is well-suited for representing situations in which an agent cooperates in a team, and each agent is able to communicate his knowledge to other agents in the team. In such a case, in many situations the agent needs nonmonotonic abilities, in order to reason about such a situation based on his own knowledge and the other agents' knowledge and ignorance. Finally, we show the effectiveness of our framework in the robotic soccer application domain.  相似文献   

16.
We consider the problem of updating non-monotonic knowledgebases represented by epistemic logic programs where disjunctiveinformation and notions of knowledge and belief can be explicitlyexpressed. We propose a formulation for epistemic logic programupdate based on a principle called minimal change and maximalcoherence. The central feature of our approach is that duringan update or a sequence of updates, contradictory informationis removed on a basis of minimal change under the semanticsof epistemic logic programs and then coherent information ismaximally retained in the update result. Through various updatescenarios, we show that our approach provides both semanticand syntactic characterizations for an update problem. We alsoinvestigate essential semantic properties of epistemic logicprogram update.  相似文献   

17.
现有的Agent信念修正、慎思、手段-目的推理等理论和方法大多基于经典一阶逻辑,对不完全的、不一致的知识,缺乏有效的处理机制.基于论辩的Agent非单调推理(包括认识推理和实践推理)理论和方法有望弥补这个不足.不过,作为一个新的研究方向,其基本概念、理论、方法及存在的关键性问题尚有待于澄清和梳理.文中首先介绍论辩的基本概念.在此基础上,分析基于论辩的Agent非单调推理的最新研究进展.最后,讨论存在的关键性问题并指出可能的研究方向.  相似文献   

18.
刘大有  王淞昕  王飞 《计算机学报》2002,25(12):1441-1444
开放逻辑是一个可以刻画知识的增长,更新以及假说的进化的逻辑理论,它开辟了常识推理研究一条新途径,并在机器学习,知识获取,故障诊断及知识库维护等领域有广泛的应用,基本的开放逻辑不能体现认知主体对所拥有的知识在相信程度上的区别,为此,文中给出了基于完备拟序的开放逻辑,该文采用假说上的完备拟序刻画信度区别,给出了新的重构概念,讨论了假说及完备拟序在知识进化过程中的更新,定义了新的认识进程并证明了所定义的认识进程具有收敛性。  相似文献   

19.
The logical omniscience problem, whereby standard models of epistemic logic treat an agent as believing all consequences of its beliefs and knowing whatever follows from what else it knows, has received plenty of attention in the literature. But many attempted solutions focus on a fairly narrow specification of the problem: avoiding the closure of belief or knowledge, rather than showing how the proposed logic is of philosophical interest or of use in computer science or artificial intelligence. Sentential epistemic logics, as opposed to traditional possible worlds approaches, do not suffer from the problems of logical omniscience but are often thought to lack interesting epistemic properties. In this paper, I focus on the case of rule-based agents, which play a key role in contemporary AI research but have been neglected in the logical literature. I develop a framework for modelling monotonic, nonmonotonic and introspective rule-based reasoners which have limited cognitive resources and prove that the resulting models have a number of interesting properties. An axiomatization of the resulting logic is given, together with completeness, decidability and complexity results.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号