子句集的可满足性判定是自动证明领域的热点之一。
Deciding satisfiability of clause set is one of the active research topics in the automated reasoning field.
语义网的关键推理问题可以化为公式的可满足性判定问题。
The key reasoning tasks of the semantic Web can be reduced to deciding the satisfiability of formulas.
定理证明中通常的想法是通过推出空子句的方法来判定子句集的可满足性。
The traditional idea used in TP is to try to deduce the empty clause to check satisfiability.
定理证明中通常的想法是通过推出空子句的方法来判定子句集的可满足性。
The traditional idea used in TP is to try to deduce the empty clause to check satisfiability.
应用推荐