7 citations · 11 across the 10 of their papers we have counts for
10 papers
Identifying Good Rules for Efficient SAT Encodings of Single-Constant Multiplication Using Machine Learning
Chufeng Jiang, Neng-Fa Zhou
The Single Constant Multiplication problem is a fundamental NP-hard optimization task in hardware design, which seeks to decompose a fixed constant using only additions, subtractio…
Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat
Neng-Fa Zhou
Many constraint satisfaction problems involve synthesizing subgraphs that satisfy certain reachability constraints. This paper presents programs in Picat for four problems selected…
Proceedings 37th International Conference on Logic Programming (Technical Communications)
Andrea Formisano, Yanhong Annie Liu, Bart Bogaerts +7
ICLP is the premier international event for presenting research in logic programming. Contributions to ICLP 2021 were sought in all areas of logic programming, including but not li…
Yet Another Comparison of SAT Encodings for the At-Most-K Constraint
Neng-Fa Zhou
The at-most-k constraint is ubiquitous in combinatorial problems, and numerous SAT encodings are available for the constraint. Prior experiments have shown the competitiveness of t…
Planning as Tabled Logic Programming
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. Picat's planner is implemen…
Using Tabled Logic Programming to Solve the Petrobras Planning Problem
Roman Barták, Neng-Fa Zhou
Tabling has been used for some time to improve efficiency of Prolog programs by memorizing answered queries. The same idea can be naturally used to memorize visited states during s…