Picture for Neng-Fa Zhou

Neng-Fa Zhou

CUNY Brooklyn College & Graduate Center

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

Add code
Sep 17, 2021
Figure 1 for Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat
Figure 2 for Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat
Figure 3 for Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat
Figure 4 for Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat
Viaarxiv icon

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

Add code
Sep 15, 2021
Viaarxiv icon

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

Add code
May 12, 2020
Figure 1 for Yet Another Comparison of SAT Encodings for the At-Most-K Constraint
Figure 2 for Yet Another Comparison of SAT Encodings for the At-Most-K Constraint
Viaarxiv icon

Planning as Tabled Logic Programming

Add code
Jul 14, 2015
Figure 1 for Planning as Tabled Logic Programming
Figure 2 for Planning as Tabled Logic Programming
Viaarxiv icon

Using Tabled Logic Programming to Solve the Petrobras Planning Problem

Add code
May 11, 2014
Figure 1 for Using Tabled Logic Programming to Solve the Petrobras Planning Problem
Figure 2 for Using Tabled Logic Programming to Solve the Petrobras Planning Problem
Figure 3 for Using Tabled Logic Programming to Solve the Petrobras Planning Problem
Figure 4 for Using Tabled Logic Programming to Solve the Petrobras Planning Problem
Viaarxiv icon

Toward a Dynamic Programming Solution for the 4-peg Tower of Hanoi Problem with Configurations

Add code
Jan 31, 2013
Figure 1 for Toward a Dynamic Programming Solution for the 4-peg Tower of Hanoi Problem with Configurations
Figure 2 for Toward a Dynamic Programming Solution for the 4-peg Tower of Hanoi Problem with Configurations
Figure 3 for Toward a Dynamic Programming Solution for the 4-peg Tower of Hanoi Problem with Configurations
Figure 4 for Toward a Dynamic Programming Solution for the 4-peg Tower of Hanoi Problem with Configurations
Viaarxiv icon

Linear Tabulated Resolution Based on Prolog Control Strategy

Add code
Mar 09, 2000
Figure 1 for Linear Tabulated Resolution Based on Prolog Control Strategy
Figure 2 for Linear Tabulated Resolution Based on Prolog Control Strategy
Figure 3 for Linear Tabulated Resolution Based on Prolog Control Strategy
Figure 4 for Linear Tabulated Resolution Based on Prolog Control Strategy
Viaarxiv icon