News for hackers. Stuff that matters.
Re:Dialogical logic programming by poizan42 on Monday February 11, 2019 @03:23PM (#19137920)
It is SAT that is NP-complete. SMT may be undecidable depending on your theories.

There are no comments on this comment yet.