可判定性

This project has focused on the decidability problem and the axiomatization problem for LTLC, and the formal verification methods for real-time systems.

本项目研究了LTLC的可判定性、公理化及实时系统的形式验证等相关问题： 1。

That field which is concerned with decidability and solvability of problems is referred to as computability theory or theory of computation, although some computer scientists advocate the inclusion of the current field of algorithms as part of the discipline.

我们把问题的可判定性和可解性的研究领域称为可计算性理论或者计算理论，虽然一些计算机科学家主张把现代算法领域包括到这门学科当中去。

The decidability of the model is proven and a decidability algorithm is presented.

证明了该模型的可判定性，并给出了判定任意一个事件是否需要审计的算法。

A formal semantics is given. We prove 79's soundness, consistency, completeness, and decidability with respect to the semantics.

本文和给出严格形式语义的基础上，证明了该系统具有可靠性、协调性、完全性和可判定性。

A model verification algorithm based on DTMA and the subset of DTMA modal logic is devised, and the decidability of the model verification is proved.

对于DTMA与DTMA模态逻辑的子集给出了一个模型验证的算法，证明了验证算法的可判定性。

The corresponding tableau algorithm is also provided. The soundness and decidability of the tableau algorithm are proved. It is shown that the complexity of tableau algorithm is PSPACE-complete.

设计了ALCKR+的语法、语义以及表算法，给出了表算法的正确性以及可判定性证明，证明表算法的时间复杂度为PSPACE-complete。

Theoretically,we simplify the proof of 〓-decidability,and practically,prompt the node-prune efficiency in Thistlewaite's decision procedure.

在理论上化简了〓的可判定性证明，在实现中提高了Thistlewaite判定过程的剪枝效率。

Keywords: continuous-time temporal logic; finite precision timed automaton; decidability; model checking.

中文关键词：连续时间时序逻辑；有限精度时间自动机；可判定性；模型检测。

OWL DL supports those users who want the maximum expressiveness while retaining computational completeness (all conclusions are guaranteed to be computable) and decidability (all computations will finish in finite time).

OWL DL 支持那些需要最强表达能力的推理系统的用户，且这个推理系统能够保证计算的完备性（computational completeness，即所有的结论都能够保证被计算出来）和可判定性（decidability，即所有的计算都在有限的时间内完成）。

Aimed to two major problems: one is not decidable and the other is no clear semantics. We construct a framework with explicit representation and formal semantics of goalsgoal description logics, which integrates two types of goals: declarative goals and procedural goals into one concept based on description logics. In addition, the goal plan is defined and analyzed, and some reasoning problems, such as goal consistency and goal satisfiability, are discussed. Contrary to traditional ways of goal description, GDLs can bridge the gap between theory and practice in a natural way.

针对传统的目标描述中存在的不可判定性以及没有清晰的语义等问题，在描述逻辑(description logics，DLs)上，将宣称型和过程型2种类型的目标描述有机地整合在一起，从而构建了具有清晰语义与可判定性的形式化框架--目标描述逻辑(goal description logics， GDLs)，在此基础上，定义了该框架下有关规划规则；建立了可用于判定目标一致性、目标可满足性的方法，与传统的目标描述方法相比，目标描述逻辑为主体领域模型提供了一种更有力的形式化工具，同时为智能主体的模型和设计提供了很好的理论工具。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。