| 2026 | FLOPS | Dynamic Programming and Tabled Logic Programming for Encoding Single-Constant Multiplication Into SAT (Declarative Pearls). | Neng-Fa Zhou, Chufeng Jiang, Hendrik Bierlee, Peter J. Stuckey |
| 2024 | CP | Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination (Short Paper). | Neng-Fa Zhou |
| 2023 | SAT | A Comparison of SAT Encodings for Acyclicity of Directed Graphs. | Neng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap |
| 2020 | CP | In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem. | Neng-Fa Zhou |
| 2018 | SoCS | Robust Multi-Agent Path Finding. | Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Bartk, Neng-Fa Zhou |
| 2017 | CP | Optimizing SAT Encodings for Arithmetic Constraints. | Neng-Fa Zhou, Hkan Kjellerstrand |
| 2017 | ICLP | // Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding. | Neng-Fa Zhou, Roman Bartk |
| 2017 | ICTAI | Modeling and Solving the Multi-agent Pathfinding Problem in Picat. | Roman Bartk, Neng-Fa Zhou, Roni Stern, Eli Boyarski, Pavel Surynek |
| 2017 | PADL | Canonicalizing High-Level Constructs in Picat. | Neng-Fa Zhou, Jonathan Fruhman |
| 2017 | SoCS | k-Robust Multi-Agent Path Finding. | Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Bartk, Neng-Fa Zhou |
| 2016 | IJCAI | Multiple-Origin-Multiple-Destination Path Finding with Minimal Arc Usage: Complexity and Models. | Roman Bartk, Neng-Fa Zhou, Agostino Dovier |
| 2016 | ICTAI | Multiple-Origin-Multiple-Destination Path Finding with Minimal Arc Usage: Complexity and Models. | Roman Bartk, Agostino Dovier, Neng-Fa Zhou |
| 2016 | PADL | The Picat-SAT Compiler. | Neng-Fa Zhou, Hkan Kjellerstrand |
| 2015 | PPDP | On modeling planning problems in tabled logic programming. | Roman Bartk, Agostino Dovier, Neng-Fa Zhou |
| 2012 | ICTAI | A Comparison of CP, IP, and SAT Solvers through a Common Interface. | Neng-Fa Zhou, Masato Tsuru, Eitaku Nobuyama |
| 2011 | ICTAI | A Tabled Prolog Program for Solving Sokoban. | Neng-Fa Zhou, Agostino Dovier |
| 2011 | LPNMR | Compiling Answer Set Programs into Event-Driven Action Rules. | Neng-Fa Zhou, Yi-Dong Shen, Jia-Huai You |
| 2010 | ICTAI | Mode-Directed Tabling for Dynamic Programming, Machine Learning, and Constraint Solving. | Neng-Fa Zhou, Yoshitaka Kameya, Taisuke Sato |
| 2009 | ICLP | Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC. | Neng-Fa Zhou |
| 2007 | ICLP | A Register-Free Abstract Prolog Machine with Jumbo Instructions. | Neng-Fa Zhou |
| 2005 | IJCAI | Generative Modeling with Failure in PRISM. | Taisuke Sato, Yoshitaka Kameya, Neng-Fa Zhou |
| 2004 | CP | A Constraint-Based Graphics Library for B-Prolog. | Neng-Fa Zhou |
| 2004 | ECAI | Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing. | Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou |
| 2004 | PPDP | Semi-naive evaluation in linear tabling. | Neng-Fa Zhou, Yi-Dong Shen, Taisuke Sato |
| 2003 | PPDP | Efficient fixpoint computation in linear tabling. | Neng-Fa Zhou, Taisuke Sato |
| 2001 | DocEng | Authoring graphics-rich and interactive documents in CGLIB: a constraint-based graphics library. | Neng-Fa Zhou |
| 2000 | PADL | Implementation of a Linear Tabling Mechanism. | Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You |
| 1999 | COMPSAC | Building Java Applets by Using DJ - A Java-based Constraint Language. | Neng-Fa Zhou |
| 1999 | ICLP | A Linear Tabling Mechanism. | Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You |
| 1999 | LPNMR | Linear Tabulated Resolutions for the Well-Founded Semantics. | Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You, Neng-Fa Zhou |
| 1998 | ICLP | A High-Level Intermediate Language and the Algorithms for Compiling Finite-Domain Constraints. | Neng-Fa Zhou |
| 1996 | ICLP | A Novel Implementation Method of Delay. | Neng-Fa Zhou |
| 1995 | ICLP | A Logic Programming Approach to Channel Routing. | Neng-Fa Zhou |
| 1994 | ICLP | On the Scheme of Passing Arguments in Stack Frames for Prolog. | Neng-Fa Zhou |
| 1993 | ICTAI | Beta-Prolog: An Extended Prolog with Boolean Tables for Combinatorial Searching. | Neng-Fa Zhou |
| 1990 | ICLP | A Matching Tree Oriented Abstract Machine for Prolog. | Neng-Fa Zhou, Toshihisa Takagi, Kazuo Ushijima |