Is there an algorithm to find out if a truthtable can be represented as 2-sat, and if so find its 2-cnf?

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

  •  05-11-2019
  •  | 
  •  

I know that not all truthtables have a corresponding 2-cnf representation, but is there a way to find out if a given truthtable has a 2-cnf representation, and if so to find what that is?

没有正确的解决方案

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