Question

应用离散数学（全英） C语言实验题目求解！~

大概就是编一个C语言程序解决下面问题，我已经彻底被打败了求大神帮忙
SAT: Satisfiability Problem
• Determine if there is a true assignment such
that a given propositional formula in CNF is
true ?
• Note that a conjunctive normal form (CNF) is a
conjunction of disjunctive clauses, where each
clause is a disjunction of literals (a primitive
proposition, or the negation of a primitive
proposition).
• For example, (¬v ∨ s ∨ r)∧(¬v ∨ ¬s) is a CNF.
SAT的上机(书面)报告

Answer 1

这是可满足性问题，就是求一个 合取范式的可满足性。
不知道要编写成什么样子。
就比如上面这个例子，令v = false就可以使得式子为真。所以该CNF是可满足的。

Answer 2

关注次问题