位置：成果数据库 > 期刊 > 期刊详情页
Davis-Putnam Reduction for Minimal Unsatisfiable formulas
  • ISSN号：0304-3975
  • 期刊名称：Theoretical Computer Science
  • 时间：0
  • 页码：-
  • 相关项目：二阶逻辑的表达能力与计算复杂性
作者： Oliver Kullmann|Xishun Zhao|
同期刊论文项目
二阶逻辑的表达能力与计算复杂性
期刊论文 15 会议论文 2
同项目期刊论文
Proof System for Planning under 0-Approximation Semantics
Resolution on Quantified Generalized Clause-sets
On Davis-Putnam reductions for minimally unsatis able clause-sets
The Complexity and Expressive Power of Second-Order Extended Logic
Transformations into Normal Forms for QBF
On Variables with Fewer Occurrences in CNF
NP-Logic Systems and Model-Equivalence Reductions
量化单一带标公式的消解
Proof System for Planning under cautious Semantics
Complexity and expressive power of second-order Extended Horn logic
带测试动作的动态时序逻辑扩展
基于谨慎语义的规划证明系统
二阶扩展逻辑的复杂性与表达能力