Can SMT solvers (such as Z3) be used to solve temporal logic problems, such as the Missionaries-and-Cannibals problem?
https://en.wikipedia.org/wiki/Satisfiability_modulo_theories
https://en.wikipedia.org/wiki/Missionaries_and_cannibals_problem
[link] [comments]











English (US) ·