Hello,
Picat version 3.0 has been released.
Version 3.0 incorporates numerous improvements on the SAT compiler. As demonstrated in the XCSP'19 and MiniZinc'20 competitions, Picat's SAT compiler, in combination with the cutting-edge SAT solvers, has become a competitive alternative, along with CP and MIP, for solving combinatorial optimization problems.
Version 3.0 supports Horn clauses. Picat translates Horn clauses into pattern-matching rules based on user-supplied or automatically generated index declarations. The support of Horn clauses facilitates porting Prolog programs to Picat. See here for is a translation of the Geoquery Prolog program to Picat. You can find many examples on Hakan Kjellerstrand's Picat page.
Version 3.0 incorporates many other enhancements and improvements. See the update log for the details.
Sincerely,
The Picat team
_______________________________________________ logic-programming mailing list [email protected] http://lists.picat-lang.org/mailman/listinfo/logic-programming
_______________________________________________ Om-announce mailing list [email protected] http://mailman.openmath.org/cgi-bin/mailman/listinfo/om-announce
