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]




![Halpatiokee Park [Stuart, FL]](https://preview.redd.it/yc2jvtj3cr3h1.jpg?width=140&height=140&crop=1:1,smart&auto=webp&s=b2f1cd5287a887343d041998e03125d29890059e)










English (US) ·