The key reasoning tasks of the semantic Web can be reduced to deciding the satisfiability of formulas.
语义网的关键推理问题可以化为公式的可满足性判定问题。
This paper compares the formulas, then explains the differences with the theory of "semantic relevance" and "idiomization".
本文拟对这三个格式进行比较，并且运用“语义的相关性”以及“熟语化”理论对这些现象进行解释。
To this end, the positive and negative transformations of propositional formulas are defined such that the semantic link between a literal and its negation is split.
为此，定义了命题公式的正变换和负变换，以便分离一个文字与其否定的语义联系。
To this end, the positive and negative transformations of propositional formulas are defined such that the semantic link between a literal and its negation is split.
为此，定义了命题公式的正变换和负变换，以便分离一个文字与其否定的语义联系。
应用推荐