Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat

no code implementations • 17 Sep 2021 • Neng-Fa Zhou

Many constraint satisfaction problems involve synthesizing subgraphs that satisfy certain reachability constraints.

Proceedings 37th International Conference on Logic Programming (Technical Communications)

no code implementations • 15 Sep 2021 • Andrea Formisano, Yanhong Annie Liu, Bart Bogaerts, Alex Brik, Veronica Dahl, Carmine Dodaro, Paul Fodor, Gian Luca Pozzato, Joost Vennekens, Neng-Fa Zhou

ICLP is the premier international event for presenting research in logic programming.

Automated Theorem Proving Data Integration +2

Yet Another Comparison of SAT Encodings for the At-Most-K Constraint

no code implementations • 12 May 2020 • Neng-Fa Zhou

The at-most-k constraint is ubiquitous in combinatorial problems, and numerous SAT encodings are available for the constraint.

Planning as Tabled Logic Programming

no code implementations • 14 Jul 2015 • Neng-Fa Zhou, Roman Bartak, Agostino Dovier

This paper describes Picat's planner, its implementation, and planning models for several domains used in International Planning Competition (IPC) 2014.

Using Tabled Logic Programming to Solve the Petrobras Planning Problem

no code implementations • 11 May 2014 • Roman Barták, Neng-Fa Zhou

Monte Carlo Tree Search has been so far the best technique to tackle this problem and we will show that by using tabling we can achieve much better runtime efficiency and better plan quality.