查询词典 decidability

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 concept of algorithm is also used to define the notion of decidability.

算法的概念，也用来界定概念的决定性。

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

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

Finally, a decidability result about LTLC is given.

此结果可用于有穷状态反应系统的自动验证。

Finding PCPs in this project will help define "decidability criteria for bounded PCP classes."

在该项目中寻找PCP将有助于定义："约束PCP的可判定标准"。

It is intended to be used in situations where very high expressiveness is more important than being able to guarantee the decidability or computational completeness of the language.

推理机采用的是Racer，下载的是RacerPro-1-9-0-Setup，四月底就不为学校及科研单位提高免费的版本了，其他的要收钱使用了。

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

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

Next time I see you,I shall give you a black eye.

下次我看见你，我会打你一顿。

In this paper,design scheme of classification system of wood surface color is established.

提出了木质板材颜色分类的系统设计方案。