News for hackers. Stuff that matters.

A comment on A CP Solution for XKCD NP Complete Restaurant Order. Parent comment

Re:A CP Solution for XKCD NP Complete Restaurant Order by colanderman on Tuesday May 28, 2013 @11:05AM (#5780437)
Z3 is based on SMT (satisfiability-modulo-theories), not constraint programming. You can probably do some constraint programming in it, but that's not what it's designed for.
[ Parent | on HN ]

There are no comments on this comment yet.