Timeline for What is the complexity of determining Satisfiability of a CNF containing both Horn and Dual Horn clauses?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2017 at 17:54 | comment | added | Kyle Jones | @csTheoryBeginner You should post this as a separate question. | |
| Nov 15, 2017 at 17:19 | comment | added | csTheoryBeginner | Thank you @Kyle Jones. If I may ask, what if the CNF contains only Horn and Xor clauses, then what is the complexity of determining Satisfiability? | |
| Nov 15, 2017 at 15:05 | vote | accept | csTheoryBeginner | ||
| Nov 15, 2017 at 1:01 | history | answered | Kyle Jones | CC BY-SA 3.0 |