1) Planning as satisfiability
基于可满足性的规划
2) satiable
[英]['seiʃiəbl] [美]['seʃɪəbḷ]
可满足的
3) satisfiability
[,sætisfaiə'biliti]
可满足性
1.
RTL hybrid satisfiability solving methods are classified into two categories:One is based on SMT(Satisfiability Modulo Theories),and the other is based on circuit structure searching.
RTL混合可满足性求解方法分为基于可满足性模理论(SMT)和基于电路结构搜索两大类。
2.
Two heuristic strategies for solving satisfiability (SAT) problem were presented.
提出了两个用于求解可满足性 (SAT)问题的启发式策略。
3.
The key reasoning tasks of the semantic Web can be reduced to deciding the satisfiability of formulas.
语义网的关键推理问题可以化为公式的可满足性判定问题。
4) Rule-based Planning
基于规则的规划
5) case-based planning
基于案例的规划
6) Partial satisfaction planning
部分满足规划
补充资料:连续性与非连续性(见间断性与不间断性)
连续性与非连续性(见间断性与不间断性)
continuity and discontinuity
11an父ux泊g四f“山。麻以角g、.连续性与非连续性(c。nt,n琳t:nuity一)_见间断性与不间断性。and diseo红ti-
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条