- 可满足性问题的充分必要条件-1引,可满足性问题(satisfiability problem,简称SA T),是指合取范式的可满足性问题,简单可以叙述为:对于一个合适公式,通常我们假定己..
基于58个网页-相关网页
... Satisfiability Checking 可满足性判定 Satisfiability problem 布尔可满足性问题 ; Boolean satisfiability 布尔可满足性问题 ; 布尔可满足性 ...
基于8个网页-相关网页
Boolean satisfiability problem 布尔可满足性问题 ; 问题SAT ; 布尔可满足问题
optimum satisfiability problem 最优可满足性问题
constraints satisfiability problem 约束满足问题
In the second part we give a game-theoretic characterization for modal mu-calculus's satisfiability problem.
第二部分对模态μ演算上的可满足性问题进行了博弈刻画,对可满足性公式可以进行模型构建,对不可满足公式可以生成反例。
参考来源 - 博弈理论在互模拟和模态μ·2,447,543篇论文数据,部分数据来源于NoteExpress
The satisfiability problem of conjunction normal form (abbreviate sat problem) is an NP_complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
Our approach is based on an extended relational calculus, and reduces the consistency problem to a satisfiability problem of relational formulae.
该方法以扩展的关系逻辑为语义基础,把一致性问题归结为关系逻辑公式的可满足性问题。
When the domain of interpretation is finite and its size is a fixed positive integer, the satisfiability problem in the first-order logic can be reduced to SAT.
当解释的论域是一个固定大小的有限集合时,一阶逻辑公式的可满足性问题可以等价地归约为SAT 问题。
应用推荐