本文关注的是计算机科学中重要的工具——等式问题的复杂性研究，特别是针对有限域上的等式问题的满足性问题。主要成果是证明了这类问题在CNF形式下的Σ²完全性。
摘要：
Equational problems (i.e.: first-order formulae with quantifier prefix 9 8 , whose only predicate symbol is syntactic equality) are an important tool in many areas of Computer Science like automated deduction, automated model building, logic programming, functional programming, etc. The aim of this work is a complexity analysis of the satisfiability problem of equational problems over a finite domain. Our main result is the Sigma p 2 -completeness proof for equational problems in CNF.
展开
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
