位置：成果数据库 > 期刊 > 期刊详情页
The Complexity of Some Subclasses of Minimal Unsatisfiable Formulas,
  • 时间：0
  • 相关项目：量化布尔公式的理论与算法研究
同期刊论文项目
量化布尔公式的理论与算法研究
期刊论文 18 会议论文 3 著作 1
同项目期刊论文
Computational Complexity of Quantified Boolean Formulas with Fixed Maximal Deficiency，
Linear CNF Formulas and Satisfiability,
Boolean Functions as Models for Quantified Boolean Formulas,
Minimal False Quantified Boolean Formulas,
An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas,
度量空间中co-regular集合的可计算性
A Timed Action Language TE
Complexity of Operators on Compact Sets
An Answer Set Programming System with Cycle Breaking Heuristic,
Comparison of Semantics of Disjunctive Logic Programs Based on Model-equivalent Reduction，
Representations of Co-regular Subsets on Euclidean Spaces
Co-regular集的可计算性探讨
量化带标公式的消解
属性论的分级推理方法
整合非单调推理及时态推理
Comparison of Semantics of Disjunctive Logic Programs Based on Model-Equivalent Reduction
一个带破圈启发方法的回答集编程系统