A Matching Tree Oriented Abstract Machine for Prolog. - Neng-Fa Zhou; Toshihisa Takagi; Kazuo Ushijima (ICLP, 1990)

Bidirectional inference of mode information for logic programs. - Neng-Fa Zhou; Kazuo Ushijima; Toshihisa Takagi (Syst. Comput. Jpn., 1991)

Implementing Graph Algorithms in BeTa-Prolog. - Neng-Fa Zhou; Isao Nagasawa (IWAR, 1992)

Beta-Prolog: An Extended Prolog with Boolean Tables for Combinatorial Searching. - Neng-Fa Zhou (ICTAI, 1993)

On the Direct Parameter Passing Mechanism for Prolog Compilers. - Neng-Fa Zhou (ILPS, 1993)

Global Optimizations in a Prolog Compiler for the TOAM. - Neng-Fa Zhou (J. Log. Program., 1993)

On the Scheme of Passing Arguments in Stack Frames for Prolog. - Neng-Fa Zhou (ICLP, 1994)

A Logic Programming Approach to Channel Routing. - Neng-Fa Zhou (ICLP, 1995)

A Novel Implementation Method of Delay. - Neng-Fa Zhou (JICSLP, 1996)

Channel Routing with Constraint Logic Programming and Delay. - Neng-Fa Zhou (IEA/AIE, 1996)

B-Prolog: A High Performance Prolog Compiler. - Neng-Fa Zhou; Isao Nagasawa; Masanobu Umeda; Keiichi Katamine; Toyohiko Hirota (IEA/AIE, 1996)

Parameter Passing and Control Stack Management in Prolog Implementation Revisited. - Neng-Fa Zhou (ACM Trans. Program. Lang. Syst., 1996)

A High-Level Intermediate Language and the Algorithms for Compiling Finite-Domain Constraints. - Neng-Fa Zhou (IJCSLP, 1998)

Building Java Applets by Using DJ - A Java-based Constraint Language. - Neng-Fa Zhou (COMPSAC, 1999)

A Linear Tabling Mechanism. - Neng-Fa Zhou; Yi-Dong Shen; Li-Yan Yuan; Jia-Huai You (ICLP, 1999)

Linear Tabulated Resolutions for the Well-Founded Semantics. - Yi-Dong Shen; Li-Yan Yuan; Jia-Huai You; Neng-Fa Zhou (LPNMR, 1999)

A Hybrid Algorithm for Compiling Equality Constraints and its Implementation. - Neng-Fa Zhou; Sosuke Kaneko (WOID@ICLP, 1999)

Authoring graphics-rich and interactive documents in CGLIB: a constraint-based graphics library. - Neng-Fa Zhou (ACM Symposium on Document Engineering, 2001)

Action Rules for Programming Constraint Propagators and Interactive User Interfaces. - Neng-Fa Zhou (INAP (LNCS Volume), 2001)

Implementation of a Linear Tabling Mechanism. - Neng-Fa Zhou; Yi-Dong Shen; Li-Yan Yuan; Jia-Huai You (J. Funct. Log. Program., 2001)

Linear tabulated resolution based on Prolog control strategy. - Yi-Dong Shen; Li-Yan Yuan; Jia-Huai You; Neng-Fa Zhou (Theory Pract. Log. Program., 2001)

Implementing Constrant Solvers in B-Prolog. - Neng-Fa Zhou (IIP, 2002)

Efficient fixpoint computation in linear tabling. - Neng-Fa Zhou; Taisuke Sato (PPDP, 2003)

CGLIB - a constraint-based graphics library. - Neng-Fa Zhou (Softw. Pract. Exp., 2003)

A Constraint-Based Graphics Library for B-Prolog. - Neng-Fa Zhou (CP, 2004)

Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing. - Yoshitaka Kameya; Taisuke Sato; Neng-Fa Zhou (ECAI, 2004)

Semi-naive evaluation in linear tabling. - Neng-Fa Zhou; Yi-Dong Shen; Taisuke Sato (PPDP, 2004)

Generative Modeling with Failure in PRISM. - Taisuke Sato; Yoshitaka Kameya; Neng-Fa Zhou (IJCAI, 2005)

Programming finite-domain constraint propagators in Action Rules. - Neng-Fa Zhou (Theory Pract. Log. Program., 2006)

A Register-Free Abstract Prolog Machine with Jumbo Instructions. - Neng-Fa Zhou (ICLP, 2007)

Linear tabling strategies and optimizations. - Neng-Fa Zhou; Taisuke Sato; Yi-Dong Shen (Theory Pract. Log. Program., 2008)

Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC. - Neng-Fa Zhou (ICLP, 2009)

Mode-Directed Tabling for Dynamic Programming, Machine Learning, and Constraint Solving. - Neng-Fa Zhou; Yoshitaka Kameya; Taisuke Sato (ICTAI (2), 2010)

Proceedings of CICLOPS-WLPE 2010 - Germán Vidal; Neng-Fa Zhou (CoRR, 2010)

Compiling Answer Set Programs into Event-Driven Action Rules. - Neng-Fa Zhou; Yi-Dong Shen; Jia-Huai You (LPNMR, 2011)

A Comparison of CP, IP, and SAT Solvers through a Common Interface. - Neng-Fa Zhou; Masato Tsuru 001; Eitaku Nobuyama (ICTAI, 2012)

The language features and architecture of B-Prolog. - Neng-Fa Zhou (Theory Pract. Log. Program., 2012)

Efficient tabling of structured data with enhanced hash-consing. - Neng-Fa Zhou; Christian Theil Have (Theory Pract. Log. Program., 2012)

On Modeling Planning Problems: Experience from the Petrobras Challenge. - Roman Barták; Neng-Fa Zhou (MICAI (2), 2013)

Picat: A Scalable Logic-based Language and System (Invited talk). - Neng-Fa Zhou (SLATE, 2013)

Toward a Dynamic Programming Solution for the 4-peg Tower of Hanoi Problem with Configurations - Neng-Fa Zhou; Jonathan Fruhman (CoRR, 2013)

A Tabled Prolog Program for Solving Sokoban. - Neng-Fa Zhou; Agostino Dovier (Fundam. Informaticae, 2013)

Combinatorial Search With Picat. - Neng-Fa Zhou (CoRR, 2014)

Using Tabled Logic Programming to Solve the Petrobras Planning Problem. - Roman Barták; Neng-Fa Zhou (Theory Pract. Log. Program., 2014)

On modeling planning problems in tabled logic programming. - Roman Barták; Agostino Dovier; Neng-Fa Zhou (PPDP, 2015)

Planning as tabled logic programming. - Neng-Fa Zhou; Roman Barták; Agostino Dovier (Theory Pract. Log. Program., 2015)

Constraint Solving and Planning with Picat - Neng-Fa Zhou; Håkan Kjellerstrand; Jonathan Fruhman (Springer, 2015)

Compiling and Executing PDDL in Picat. - Marco De Bortoli; Roman Barták; Agostino Dovier; Neng-Fa Zhou (CILC, 2016)

Multiple-Origin-Multiple-Destination Path Finding with Minimal Arc Usage: Complexity and Models. - Roman Barták; Neng-Fa Zhou; Agostino Dovier (KnowProS@IJCAI, 2016)

The Picat-SAT Compiler. - Neng-Fa Zhou; Håkan Kjellerstrand (PADL, 2016)

Programming in Picat. - Neng-Fa Zhou (RuleML, 2016)

Optimizing SAT Encodings for Arithmetic Constraints. - Neng-Fa Zhou; Håkan Kjellerstrand (CP, 2017)

// Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding. - Neng-Fa Zhou; Roman Barták (ICLP (Technical Communications), 2017)

Modeling and Solving the Multi-agent Pathfinding Problem in Picat. - Roman Barták; Neng-Fa Zhou; Roni Stern; Eli Boyarski; Pavel Surynek (ICTAI, 2017)

Canonicalizing High-Level Constructs in Picat. - Neng-Fa Zhou; Jonathan Fruhman (PADL, 2017)

k-Robust Multi-Agent Path Finding. - Dor Atzmon; Ariel Felner; Roni Stern; Glenn Wagner; Roman Barták; Neng-Fa Zhou (SOCS, 2017)

Modeling and solving planning problems in tabled logic programming: Experience from the Cave Diving domain. - Roman Barták; Lukás Chrpa; Agostino Dovier; Jindrich Vodrázka; Neng-Fa Zhou (Sci. Comput. Program., 2017)

Robust Multi-Agent Path Finding. - Dor Atzmon; Roni Stern; Ariel Felner; Glenn Wagner; Roman Barták; Neng-Fa Zhou (SOCS, 2018)

In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem. - Neng-Fa Zhou (CP, 2020)

Yet Another Comparison of SAT Encodings for the At-Most-K Constraint. - Neng-Fa Zhou (CoRR, 2020)

Robust Multi-Agent Path Finding and Executing. - Dor Atzmon; Roni Stern; Ariel Felner; Glenn Wagner; Roman Barták; Neng-Fa Zhou (J. Artif. Intell. Res., 2020)

Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat. - Neng-Fa Zhou (ICLP Technical Communications, 2021)

A Comparison of SAT Encodings for Acyclicity of Directed Graphs. - Neng-Fa Zhou; Ruiwei Wang; Roland H. C. Yap (SAT, 2023)

Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination (Short Paper). - Neng-Fa Zhou (CP, 2024)

Picat Through the Lens of Advent of Code. - Neng-Fa Zhou; Cristian Grozea; Håkan Kjellerstrand; Oisín Mac Fhearaí (CoRR, 2025)