共查询到16条相似文献,搜索用时 19 毫秒
1.
2.
循环术语集是描述逻辑长期以来的研究难点,它的最基本的问题即语义及推理问题没有得到合理的解决。分析了描述逻辑循环术语集的研究现状和存在的问题,基于图的互模拟的方法,给出了描述逻辑FL0循环术语集的可满足性条件。结果证明循环术语集的可满足性的推理是多项式复杂的。 相似文献
3.
Christopher M. Kellett Andrew R. Teel 《Mathematics of Control, Signals, and Systems (MCSS)》2007,19(3):183-205
Difference inclusions arise naturally in the study of discrete-time or sampled-data systems. We develop two novel sufficient
conditions for robustness of a stability property referred to as -stability with respect to an arbitrary measure; i.e., where a continuous positive definite function of the solutions satisfies
a class- estimate of time and the continuous positive definite function of the initial condition.
Christopher M. Kellett was supported by the Australian Research Council under Discovery Project Grant DP0771131. Andrew R.
Teel was supported by NSF grants ECS-0324679, ECS-0622253, and AFOSR grants F49620-03-1-0203 and FA9550-06-1-0134. 相似文献
4.
In this paper, the method of well-combined semantics and syntax proposed by Pavelka is applied to the research of the propositional
calculus formal system
. The partial constant values are taken as formulas, formulas are fuzzified in two manners of semantics and syntax, and inferring
processes are fuzzified. A sequence of new extensions {
} of the system
is proposed, and the completeness of
is proved. 相似文献
5.
Projection matrices from projective spaces
have long been used in multiple-view geometry to model the perspective projection created by the pin-hole camera. In this work we introduce higher-dimensional mappings
for the representation of various applications in which the world we view is no longer rigid. We also describe the multi-view constraints from these new projection matrices (where k > 3) and methods for extracting the (non-rigid) structure and motion for each application. 相似文献
6.
The concepts of metric R 0-algebra and Hilbert cube of type R 0 are introduced. A unified approximate reasoning theory in propositional caculus system $\mathcal{L}^* $ and predicate calculus system $\mathcal{K}^* $ is established semantically as well as syntactically, and a unified complete theorem is obtained. 相似文献
7.
Priorities on defaults with prerequisites,and their application in treating specificity in terminological default logic 总被引:2,自引:0,他引:2
In a recent paper we have proposed terminological default logic as a formalism that combines means both for structured representation of classes and objects and for default inheritance of properties. The major drawback that terminological default logic inherits from general default logic is that it does not take precedence of more specific defaults over more general ones into account. This behavior has already been criticized in the general context of default logic, but it is all the more problematic in the terminological case where the emphasis lies on the hierarchical organization of concepts.The present paper addresses the problem of modifying terminological default logic such that more specific defaults are preferred. We assume that the specificity ordering is induced by the hierarchical organization of concepts, which means that default information is not taken into account when computing priorities. It turns out that the existing approaches for expressing priorities between defaults do not seem to be appropriate for defaults with prerequisites. Therefore we shall consider an alternative approach for dealing with prioritization in the framework of Reiter's default logic. The formalism is presented in the general setting of default logic where priorities are given by an arbitrary partial ordering on the defaults. We shall exhibit some interesting properties of the new formalism, compare it with existing approaches, and describe an algorithm for computing extensions. In the terminological case, we thus obtain an automated default reasoning procedure that takes specificity into account.This is an extended version of a paper presented at the13th International Joint Conference on Artificial Intelligence, August 1993, Chambery, France. 相似文献
8.
循环术语集是描述逻辑长期以来的研究难点,它的最基本的问题即语义及推理问题没有得到合理的解决.文中分析了描述逻辑循环术语集的研究现状和存在的问题,在Baader的基础上进一步研究了描述逻辑FL~-循环术语集的语义及推理问题.给出了FL~-循环术语集的语法、语义和不动点模型的构造方法.针对FL~-循环术语集的需要,提出了一种新的有限自动机,使用有限自动机给出了不动点语义和描述语义下FL~-循环术语集的可满足性和包含推理算法,证明了推理算法的正确性,并给出了推理算法的复杂性定理. 相似文献
9.
基于扩展序类逻辑的Ontology形式化描述与模型检验 总被引:1,自引:1,他引:1
本体一直是哲学中的词汇,后来随着计算机语义网络的发展,引入语义web领域,用来表示概念以及概念和概念之间的关系.用逻辑来形式化Ontology,并对形式化后的Ontology进行检验和推理一直是Ontology研究的热点和难点.参考描述逻辑描述本体的方法,提出了以扩展序类逻辑来描述本体,并对描述后的本体进行检验. 相似文献
10.
提出了一个基于描述逻辑规则的自动服务交互的模型框架,将服务抽象成基于消息的服务模型。该服务模型将在服务之间传递的面向对象的服务消息作为服务交互的主要手段,使用描述逻辑的概念对服务之间传递的消息数据进行语义分析,在服务内部数据模式与描述逻辑知识库间建立对应关系。在交互规则方面,使用基于描述逻辑和Horn子句进行描述;在描述逻辑的Tableau算法的支持下,对知识库概念和规则进行有效性、一致性和可满足性的验证,实现数据异构模式下服务间基于语义的自动交互。 相似文献
11.
提出了一个基于描述逻辑规则的自动服务交互的模型框架,将服务抽象成基于消息的服务模型。该服务模型将在服务之间传递的面向对象的服务消息作为服务交互的主要手段,使用描述逻辑的概念对服务之间传递的消息数据进行语义分析,在服务内部数据模式与描述逻辑知识库间建立对应关系。在交互规则方面,使用基于描述逻辑和Horn子句进行描述;在描述逻辑的Tableau算法的支持下,对知识库概念和规则进行有效性、一致性和可满足性的验证,实现数据异构模式下服务间基于语义的自动交互。 相似文献
12.
13.
An approach to the synthesis of an automaton specified by a formula of the logical language
is proposed. This approach makes it possible to construct the automaton inductively, i.e., according to the structure of the formula, starting from automata corresponding to subformulas represented in the form of conjunction or disjunction of literals. 相似文献
14.
15.
The concept of truth degrees of formulas in (L)ukasiewicz n-valued proposi tional logic Ln is proposed. A limit theorem is obtained, which says that the truth function (T)n induced by truth degrees converges to the integrated truth function (T) when n converges to infinite. Hence this limit theorem builds a bridge between the discrete valued (L)ukasiewicz logic and the continuous valued (L)ukasiewicz logic. Moreover, the results obrained in the present paper is a natural generalization of the corresponding results obtained in two-valued propositional logic. 相似文献
16.
This paper presents a two-phase control logic for anti-lock braking systems (ABS). ABS are by now a standard component in every modern car, preventing the wheels from going into a lock situation where the wheels are fixed by the brake and the stopping distances are greatly prolonged. There are different approaches to such control logics. An ABS design proposed in recent literature controls the wheel's slip by creating stable limit cycles in the corresponding phase space. This design is modified via an analytical approach that is derived from perturbation theory. Simulation results document shorter braking distance compared to available tests in the literature. 相似文献