英语语法分析

RTL hybrid satisfiability solving is the key technique of RTL verification.

RTL混合可满足性求解是RTL验证中的关键技术。

The traditional idea used in TP is to try to deduce the empty clause to check satisfiability.

定理证明中通常的想法是通过推出空子句的方法来判定子句集的可满足性。

The key reasoning tasks of the semantic Web can be reduced to deciding the satisfiability of formulas.

语义网的关键推理问题可以化为公式的可满足性判定问题。