If a CNF contains only Horn and Xor clauses, then what is the complexity of determining Satisfiability?

cs.stackexchange https://cs.stackexchange.com/questions/84146

题

If a CNF contains only Horn and Xor clauses, and does not contain clauses of other types, then can its Satisfiability be determined in polynomial time?

没有正确的解决方案

许可以下： CC-BY-SA 和 归因
不隶属于 cs.stackexchange
scroll top