Neng-Fa Zhou

80 papers A* 1A 7B 18C 9Journal 26Unranked 17
YearRankTypeTitle / Venue / Authors
2025 B conf
Picat Through the Lens of Advent of Code.
ICLP
Neng-Fa Zhou, Cristian Grozea, Håkan Kjellerstrand, Oisín Mac Fhearaí
2024 A conf
Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination (Short Paper).
CP
Neng-Fa Zhou
2023 A conf
A Comparison of SAT Encodings for Acyclicity of Directed Graphs.
SAT
Neng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap
2021 — conf
Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat.
ICLP Technical Communications
Neng-Fa Zhou
2021 — ed.
Proceedings 37th International Conference on Logic Programming (Technical Communications), ICLP Technical Communications 2021, Porto (virtual event), 20-27th September 2021.
ICLP Technical Communications
Andrea Formisano, Yanhong Annie Liu, Bart Bogaerts, Alex Brik, Verónica Dahl, Carmine Dodaro, Paul Fodor, Gian Luca Pozzato, Joost Vennekens, Neng-Fa Zhou
2020 A conf
In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem.
CP
Neng-Fa Zhou
2020 J jnl
Robust Multi-Agent Path Finding and Executing.
J. Artif. Intell. Res.
Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou
2020 J jnl
Yet Another Comparison of SAT Encodings for the At-Most-K Constraint.
CoRR
Neng-Fa Zhou
2018 A conf
Robust Multi-Agent Path Finding.
AAMAS
Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou
2018 B conf
Robust Multi-Agent Path Finding.
SOCS
Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou
2017 — conf
// Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding.
ICLP (Technical Communications)
Neng-Fa Zhou, Roman Barták
2017 C conf
Canonicalizing High-Level Constructs in Picat.
PADL
Neng-Fa Zhou, Jonathan Fruhman
2017 B conf
Modeling and Solving the Multi-agent Pathfinding Problem in Picat.
ICTAI
Roman Barták, Neng-Fa Zhou, Roni Stern, Eli Boyarski, Pavel Surynek
2017 J jnl
Modeling and solving planning problems in tabled logic programming: Experience from the Cave Diving domain.
Sci. Comput. Program.
Roman Barták, Lukás Chrpa, Agostino Dovier, Jindrich Vodrázka, Neng-Fa Zhou
2017 A conf
Optimizing SAT Encodings for Arithmetic Constraints.
CP
Neng-Fa Zhou, Håkan Kjellerstrand
2017 B conf
k-Robust Multi-Agent Path Finding.
SOCS
Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng-Fa Zhou
2016 — conf
Compiling and Executing PDDL in Picat.
CILC
Marco De Bortoli, Roman Barták, Agostino Dovier, Neng-Fa Zhou
2016 B conf
Multiple-Origin-Multiple-Destination Path Finding with Minimal Arc Usage: Complexity and Models.
ICTAI
Roman Barták, Agostino Dovier, Neng-Fa Zhou
2016 — conf
Multiple-Origin-Multiple-Destination Path Finding with Minimal Arc Usage: Complexity and Models.
KnowProS@IJCAI
Roman Barták, Neng-Fa Zhou, Agostino Dovier
2016 — conf
Programming in Picat.
RuleML
Neng-Fa Zhou
2016 C conf
The Picat-SAT Compiler.
PADL
Neng-Fa Zhou, Håkan Kjellerstrand
2015 — book
Constraint Solving and Planning with Picat
Neng-Fa Zhou, Håkan Kjellerstrand, Jonathan Fruhman
2015 C conf
On modeling planning problems in tabled logic programming.
PPDP
Roman Barták, Agostino Dovier, Neng-Fa Zhou
2015 J jnl
Planning as Tabled Logic Programming.
CoRR
Neng-Fa Zhou, Roman Barták, Agostino Dovier
2015 J jnl
Planning as tabled logic programming.
Theory Pract. Log. Program.
Neng-Fa Zhou, Roman Barták, Agostino Dovier
2014 J jnl
Combinatorial Search With Picat.
CoRR
Neng-Fa Zhou
2014 J jnl
Using Tabled Logic Programming to Solve the Petrobras Planning Problem.
CoRR
Roman Barták, Neng-Fa Zhou
2014 J jnl
Using Tabled Logic Programming to Solve the Petrobras Planning Problem.
Theory Pract. Log. Program.
Roman Barták, Neng-Fa Zhou
2013 J jnl
A Tabled Prolog Program for Solving Sokoban.
Fundam. Informaticae
Neng-Fa Zhou, Agostino Dovier
2013 — conf
On Modeling Planning Problems: Experience from the Petrobras Challenge.
MICAI (2)
Roman Barták, Neng-Fa Zhou
2013 — conf
Picat: A Scalable Logic-based Language and System (Invited talk).
SLATE
Neng-Fa Zhou
2013 J jnl
Toward a Dynamic Programming Solution for the 4-peg Tower of Hanoi Problem with Configurations
CoRR
Neng-Fa Zhou, Jonathan Fruhman
2012 B conf
A Comparison of CP, IP, and SAT Solvers through a Common Interface.
ICTAI
Neng-Fa Zhou, Masato Tsuru, Eitaku Nobuyama
2012 J jnl
Efficient Tabling of Structured Data with Enhanced Hash-Consing
CoRR
Neng-Fa Zhou, Christian Theil Have
2012 J jnl
Efficient tabling of structured data with enhanced hash-consing.
Theory Pract. Log. Program.
Neng-Fa Zhou, Christian Theil Have
2012 C ed.
Practical Aspects of Declarative Languages - 14th International Symposium, PADL 2012, Philadelphia, PA, USA, January 23-24, 2012. Proceedings
PADL
Claudio V. Russo, Neng-Fa Zhou
2012 J jnl
The language features and architecture of B-Prolog.
Theory Pract. Log. Program.
Neng-Fa Zhou
2011 — conf
A Tabled Prolog Program for Solving Sokoban.
CILC
Neng-Fa Zhou, Agostino Dovier
2011 B conf
A Tabled Prolog Program for Solving Sokoban.
ICTAI
Neng-Fa Zhou, Agostino Dovier
2011 B conf
Compiling Answer Set Programs into Event-Driven Action Rules.
LPNMR
Neng-Fa Zhou, Yi-Dong Shen, Jia-Huai You
2011 J jnl
The Language Features and Architecture of B-Prolog
CoRR
Neng-Fa Zhou
2010 — conf
Mode-Directed Tabling for Dynamic Programming, Machine Learning, and Constraint Solving.
ICTAI (2)
Neng-Fa Zhou, Yoshitaka Kameya, Taisuke Sato
2010 J jnl
Proceedings of CICLOPS-WLPE 2010
CoRR
Germán Vidal, Neng-Fa Zhou
2009 B conf
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC.
ICLP
Neng-Fa Zhou
2008 J jnl
Linear tabling strategies and optimizations.
Theory Pract. Log. Program.
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
2007 B conf
A Register-Free Abstract Prolog Machine with Jumbo Instructions.
ICLP
Neng-Fa Zhou
2007 J jnl
Linear Tabling Strategies and Optimizations
CoRR
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
2006 J jnl
Programming finite-domain constraint propagators in Action Rules.
Theory Pract. Log. Program.
Neng-Fa Zhou
2005 A* conf
Generative Modeling with Failure in PRISM.
IJCAI
Taisuke Sato, Yoshitaka Kameya, Neng-Fa Zhou
2005 J jnl
Programming Finite-Domain Constraint Propagators in Action Rules
CoRR
Neng-Fa Zhou
2004 A conf
A Constraint-Based Graphics Library for B-Prolog.
CP
Neng-Fa Zhou
2004 C conf
Semi-naive evaluation in linear tabling.
PPDP
Neng-Fa Zhou, Yi-Dong Shen, Taisuke Sato
2004 A conf
Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing.
ECAI
Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou
2003 J jnl
CGLIB - a constraint-based graphics library.
Softw. Pract. Exp.
Neng-Fa Zhou
2003 C conf
Efficient fixpoint computation in linear tabling.
PPDP
Neng-Fa Zhou, Taisuke Sato
2002 — conf
Implementing Constrant Solvers in B-Prolog.
IIP
Neng-Fa Zhou
2001 — conf
Action Rules for Programming Constraint Propagators and Interactive User Interfaces.
INAP
Neng-Fa Zhou
2001 — conf
Action Rules for Programming Constraint Propagators and Interactive User Interfaces.
INAP (LNCS Volume)
Neng-Fa Zhou
2001 B conf
Authoring graphics-rich and interactive documents in CGLIB: a constraint-based graphics library.
ACM Symposium on Document Engineering
Neng-Fa Zhou
2001 J jnl
Implementation of a Linear Tabling Mechanism.
J. Funct. Log. Program.
Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You
2001 J jnl
Linear tabulated resolution based on Prolog control strategy.
Theory Pract. Log. Program.
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You, Neng-Fa Zhou
2000 C conf
Implementation of a Linear Tabling Mechanism.
PADL
Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You
2000 J jnl
Linear Tabulated Resolution Based on Prolog Control Strategy
CoRR
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You, Neng-Fa Zhou
1999 — conf
A Hybrid Algorithm for Compiling Equality Constraints and its Implementation.
WOID@ICLP
Neng-Fa Zhou, Sosuke Kaneko
1999 B conf
A Linear Tabling Mechanism.
ICLP
Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You
1999 B conf
Building Java Applets by Using DJ - A Java-based Constraint Language.
COMPSAC
Neng-Fa Zhou
1999 B conf
Linear Tabulated Resolutions for the Well-Founded Semantics.
LPNMR
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You, Neng-Fa Zhou
1998 — conf
A High-Level Intermediate Language and the Algorithms for Compiling Finite-Domain Constraints.
IJCSLP
Neng-Fa Zhou
1996 — conf
A Novel Implementation Method of Delay.
JICSLP
Neng-Fa Zhou
1996 C conf
B-Prolog: A High Performance Prolog Compiler.
IEA/AIE
Neng-Fa Zhou, Isao Nagasawa, Masanobu Umeda, Keiichi Katamine, Toyohiko Hirota
1996 C conf
Channel Routing with Constraint Logic Programming and Delay.
IEA/AIE
Neng-Fa Zhou
1996 J jnl
Parameter Passing and Control Stack Management in Prolog Implementation Revisited.
ACM Trans. Program. Lang. Syst.
Neng-Fa Zhou
1995 B conf
A Logic Programming Approach to Channel Routing.
ICLP
Neng-Fa Zhou
1994 B conf
On the Scheme of Passing Arguments in Stack Frames for Prolog.
ICLP
Neng-Fa Zhou
1993 B conf
Beta-Prolog: An Extended Prolog with Boolean Tables for Combinatorial Searching.
ICTAI
Neng-Fa Zhou
1993 J jnl
Global Optimizations in a Prolog Compiler for the TOAM.
J. Log. Program.
Neng-Fa Zhou
1993 — conf
On the Direct Parameter Passing Mechanism for Prolog Compilers.
ILPS
Neng-Fa Zhou
1992 — conf
Implementing Graph Algorithms in BeTa-Prolog.
IWAR
Neng-Fa Zhou, Isao Nagasawa
1991 J jnl
Bidirectional inference of mode information for logic programs.
Syst. Comput. Jpn.
Neng-Fa Zhou, Kazuo Ushijima, Toshihisa Takagi
1990 B conf
A Matching Tree Oriented Abstract Machine for Prolog.
ICLP
Neng-Fa Zhou, Toshihisa Takagi, Kazuo Ushijima