查询词典 decidability

Reachability is one of the most basic and important dynamic properties of Petri nets. But the reachability decidability problem has at least exponential space complexity and no effective algorithm is found by now.

可达性是Petri网最基本最重要的动态性质之一，但一般Petri网的可达性判定问题至少具有指数空间复杂度，且目前尚无有效的判定算法。

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判定过程的剪枝效率。

First of all,we elaborate a formal variant of Description Logics,namely, ALCQO,which is capable of extending the conceptual modeling ability of classical DLs with process modeling and numerical constraint representation ability, while still retains decidability for major reasoning problems.

与传统的描述逻辑不同，ALCQO既保留了一定的概念建模能力，还显著的增强了在数字属性和时序关系上的表达能力，因此对Web服务的功能属性以及非功能属性都具有足够的表达能力。

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，即所有的计算都在有限的时间内完成）。

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，即所有的计算都在有限的时间内完成）。

Two normal forms, best-simple normal form and literal normal form, are presented at first in order to eliminate the complexity of formulas decision. Based on the two normal forms, a deduction proof of decidability theorem in L and a decision algorithm P based on deduction for proportional formulas are given and a decision machine found on P, DMBD, is also designed.

首先提出了消解复杂性的两种范式：最简范式和文字范式，在此基础上给出了L的可判性定理的演绎证明及命题公式的演绎判定算法P，并基于ML语言设计了基于P的演绎判定机DMBD。

Based on the two normal forms, the decidability theorem in L is then proved and a deduction-based decision algorithm P is designed. The time complexity O(n3) of P is much less than the complexity O(2n) of the true value table method and the complexity O(n5) of HAL based on the tactic scheme.

首先定义了消解复杂性的两种范式：最简范式和文字范式，在此基础上采用演绎方法证明了L中的可判定性定理，并设计了命题公式的演绎判定算法P。P的时间复杂度为O(n^3)，远远小于基于真值表法的O(2^n)和基于策略方案HAL的O(n^5)。

OWL DL supports those users who want the maximum expressiveness without losing computational completeness (all entailments are guaranteed to be computed) and decidability (all computations will finish in finite time) of reasoning systems.

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

Liapunov—Schmidt method is one of the most important method in the bifurcation theory.

Liapunov—Schmidt方法是分叉理论的最重要方法之一。

Be courteous -- even when people are most discourteous to you .

要有礼貌──即使当別人对你最不礼貌的时候。