default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeng-Fa Zhou
Person information
- affiliation: Brooklyn College, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b1]Neng-Fa Zhou, Håkan Kjellerstrand, Jonathan Fruhman:
Constraint Solving and Planning with Picat. Springer Briefs in Intelligent Systems, Springer 2015, ISBN 978-3-319-25881-2, pp. 1-139
Journal Articles
- 2020
- [j15]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták
, Neng-Fa Zhou:
Robust Multi-Agent Path Finding and Executing. J. Artif. Intell. Res. 67: 549-579 (2020) - 2017
- [j14]Roman Barták, Lukás Chrpa, Agostino Dovier, Jindrich Vodrázka, Neng-Fa Zhou:
Modeling and solving planning problems in tabled logic programming: Experience from the Cave Diving domain. Sci. Comput. Program. 147: 54-77 (2017) - 2015
- [j13]Neng-Fa Zhou, Roman Barták, Agostino Dovier:
Planning as tabled logic programming. Theory Pract. Log. Program. 15(4-5): 543-558 (2015) - 2014
- [j12]Roman Barták, Neng-Fa Zhou:
Using Tabled Logic Programming to Solve the Petrobras Planning Problem. Theory Pract. Log. Program. 14(4-5): 697-710 (2014) - 2013
- [j11]Neng-Fa Zhou, Agostino Dovier:
A Tabled Prolog Program for Solving Sokoban. Fundam. Informaticae 124(4): 561-575 (2013) - 2012
- [j10]Neng-Fa Zhou:
The language features and architecture of B-Prolog. Theory Pract. Log. Program. 12(1-2): 189-218 (2012) - [j9]Neng-Fa Zhou, Christian Theil Have:
Efficient tabling of structured data with enhanced hash-consing. Theory Pract. Log. Program. 12(4-5): 547-563 (2012) - 2008
- [j8]Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen:
Linear tabling strategies and optimizations. Theory Pract. Log. Program. 8(1): 81-109 (2008) - 2006
- [j7]Neng-Fa Zhou:
Programming finite-domain constraint propagators in Action Rules. Theory Pract. Log. Program. 6(5): 483-507 (2006) - 2003
- [j6]Neng-Fa Zhou:
CGLIB - a constraint-based graphics library. Softw. Pract. Exp. 33(13): 1199-1216 (2003) - 2001
- [j5]Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You:
Implementation of a Linear Tabling Mechanism. J. Funct. Log. Program. 2001(10) (2001) - [j4]Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You, Neng-Fa Zhou:
Linear tabulated resolution based on Prolog control strategy. Theory Pract. Log. Program. 1(1): 71-103 (2001) - 1996
- [j3]Neng-Fa Zhou:
Parameter Passing and Control Stack Management in Prolog Implementation Revisited. ACM Trans. Program. Lang. Syst. 18(6): 752-779 (1996) - 1993
- [j2]Neng-Fa Zhou:
Global Optimizations in a Prolog Compiler for the TOAM. J. Log. Program. 15(4): 275-294 (1993) - 1991
- [j1]Neng-Fa Zhou, Kazuo Ushijima, Toshihisa Takagi:
Bidirectional inference of mode information for logic programs. Syst. Comput. Jpn. 22(4): 1-9 (1991)
Conference and Workshop Papers
- 2024
- [c50]Neng-Fa Zhou:
Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination (Short Paper). CP 2024: 40:1-40:8 - 2023
- [c49]Neng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap:
A Comparison of SAT Encodings for Acyclicity of Directed Graphs. SAT 2023: 30:1-30:9 - 2021
- [c48]Neng-Fa Zhou:
Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat. ICLP Technical Communications 2021: 165-178 - 2020
- [c47]Neng-Fa Zhou:
In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem. CP 2020: 585-602 - 2018
- [c46]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding. AAMAS 2018: 1862-1864 - [c45]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding. SOCS 2018: 2-9 - 2017
- [c44]Neng-Fa Zhou, Håkan Kjellerstrand:
Optimizing SAT Encodings for Arithmetic Constraints. CP 2017: 671-686 - [c43]Neng-Fa Zhou, Roman Barták:
// Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding. ICLP (Technical Communications) 2017: 11:1-11:2 - [c42]Roman Barták, Neng-Fa Zhou, Roni Stern, Eli Boyarski, Pavel Surynek:
Modeling and Solving the Multi-agent Pathfinding Problem in Picat. ICTAI 2017: 959-966 - [c41]Neng-Fa Zhou, Jonathan Fruhman:
Canonicalizing High-Level Constructs in Picat. PADL 2017: 19-33 - [c40]Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
k-Robust Multi-Agent Path Finding. SOCS 2017: 157-158 - 2016
- [c39]Marco De Bortoli, Roman Barták, Agostino Dovier, Neng-Fa Zhou:
Compiling and Executing PDDL in Picat. CILC 2016: 132-147 - [c38]Roman Barták, Agostino Dovier, Neng-Fa Zhou:
Multiple-Origin-Multiple-Destination Path Finding with Minimal Arc Usage: Complexity and Models. ICTAI 2016: 91-97 - [c37]Roman Barták, Neng-Fa Zhou, Agostino Dovier:
Multiple-Origin-Multiple-Destination Path Finding with Minimal Arc Usage: Complexity and Models. KnowProS@IJCAI 2016 - [c36]Neng-Fa Zhou, Håkan Kjellerstrand:
The Picat-SAT Compiler. PADL 2016: 48-62 - [c35]Neng-Fa Zhou:
Programming in Picat. RuleML 2016: 3-18 - 2015
- [c34]Roman Barták, Agostino Dovier, Neng-Fa Zhou:
On modeling planning problems in tabled logic programming. PPDP 2015: 31-42 - 2013
- [c33]Roman Barták, Neng-Fa Zhou:
On Modeling Planning Problems: Experience from the Petrobras Challenge. MICAI (2) 2013: 466-477 - [c32]Neng-Fa Zhou:
Picat: A Scalable Logic-based Language and System (Invited talk). SLATE 2013: 5-6 - 2012
- [c31]Neng-Fa Zhou, Masato Tsuru, Eitaku Nobuyama:
A Comparison of CP, IP, and SAT Solvers through a Common Interface. ICTAI 2012: 41-48 - 2011
- [c30]Neng-Fa Zhou, Agostino Dovier:
A Tabled Prolog Program for Solving Sokoban. CILC 2011: 215-228 - [c29]Neng-Fa Zhou, Agostino Dovier:
A Tabled Prolog Program for Solving Sokoban. ICTAI 2011: 896-897 - [c28]Neng-Fa Zhou, Yi-Dong Shen, Jia-Huai You:
Compiling Answer Set Programs into Event-Driven Action Rules. LPNMR 2011: 376-381 - 2010
- [c27]Neng-Fa Zhou, Yoshitaka Kameya, Taisuke Sato:
Mode-Directed Tabling for Dynamic Programming, Machine Learning, and Constraint Solving. ICTAI (2) 2010: 213-218 - 2009
- [c26]Neng-Fa Zhou:
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC. ICLP 2009: 402-416 - 2007
- [c25]Neng-Fa Zhou:
A Register-Free Abstract Prolog Machine with Jumbo Instructions. ICLP 2007: 455-457 - 2005
- [c24]Taisuke Sato, Yoshitaka Kameya, Neng-Fa Zhou:
Generative Modeling with Failure in PRISM. IJCAI 2005: 847-852 - 2004
- [c23]Neng-Fa Zhou:
A Constraint-Based Graphics Library for B-Prolog. CP 2004: 819-820 - [c22]Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou:
Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing. ECAI 2004: 490-494 - [c21]Neng-Fa Zhou, Yi-Dong Shen, Taisuke Sato:
Semi-naive evaluation in linear tabling. PPDP 2004: 90-97 - 2003
- [c20]Neng-Fa Zhou, Taisuke Sato:
Efficient fixpoint computation in linear tabling. PPDP 2003: 275-283 - 2002
- [c19]Neng-Fa Zhou:
Implementing Constrant Solvers in B-Prolog. Intelligent Information Processing 2002: 249-260 - 2001
- [c18]Neng-Fa Zhou:
Authoring graphics-rich and interactive documents in CGLIB: a constraint-based graphics library. ACM Symposium on Document Engineering 2001: 28-37 - [c17]Neng-Fa Zhou:
Action Rules for Programming Constraint Propagators and Interactive User Interfaces. INAP 2001: 57 - [c16]Neng-Fa Zhou:
Action Rules for Programming Constraint Propagators and Interactive User Interfaces. INAP (LNCS Volume) 2001: 197-204 - 2000
- [c15]Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You:
Implementation of a Linear Tabling Mechanism. PADL 2000: 109-123 - 1999
- [c14]Neng-Fa Zhou:
Building Java Applets by Using DJ - A Java-based Constraint Language. COMPSAC 1999: 442-447 - [c13]Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You:
A Linear Tabling Mechanism. ICLP 1999: 618 - [c12]Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You, Neng-Fa Zhou:
Linear Tabulated Resolutions for the Well-Founded Semantics. LPNMR 1999: 192-205 - [c11]Neng-Fa Zhou, Sosuke Kaneko:
A Hybrid Algorithm for Compiling Equality Constraints and its Implementation. WOID@ICLP 1999: 199-207 - 1998
- [c10]Neng-Fa Zhou:
A High-Level Intermediate Language and the Algorithms for Compiling Finite-Domain Constraints. IJCSLP 1998: 70-84 - 1996
- [c9]Neng-Fa Zhou:
A Novel Implementation Method of Delay. JICSLP 1996: 97-111 - [c8]Neng-Fa Zhou:
Channel Routing with Constraint Logic Programming and Delay. IEA/AIE 1996: 383-388 - [c7]Neng-Fa Zhou, Isao Nagasawa, Masanobu Umeda, Keiichi Katamine, Toyohiko Hirota:
B-Prolog: A High Performance Prolog Compiler. IEA/AIE 1996: 790 - 1995
- [c6]Neng-Fa Zhou:
A Logic Programming Approach to Channel Routing. ICLP 1995: 217-231 - 1994
- [c5]Neng-Fa Zhou:
On the Scheme of Passing Arguments in Stack Frames for Prolog. ICLP 1994: 159-174 - 1993
- [c4]Neng-Fa Zhou:
Beta-Prolog: An Extended Prolog with Boolean Tables for Combinatorial Searching. ICTAI 1993: 312-319 - [c3]Neng-Fa Zhou:
On the Direct Parameter Passing Mechanism for Prolog Compilers. ILPS 1993: 655 - 1992
- [c2]Neng-Fa Zhou, Isao Nagasawa:
Implementing Graph Algorithms in BeTa-Prolog. IWAR 1992: 23-32 - 1990
- [c1]Neng-Fa Zhou, Toshihisa Takagi, Kazuo Ushijima:
A Matching Tree Oriented Abstract Machine for Prolog. ICLP 1990: 159-173
Editorship
- 2021
- [e2]Andrea Formisano, Yanhong Annie Liu, Bart Bogaerts, Alex Brik, Verónica Dahl, Carmine Dodaro, Paul Fodor, Gian Luca Pozzato, Joost Vennekens, Neng-Fa Zhou:
Proceedings 37th International Conference on Logic Programming (Technical Communications), ICLP Technical Communications 2021, Porto (virtual event), 20-27th September 2021. EPTCS 345, 2021 [contents] - 2012
- [e1]Claudio V. Russo, Neng-Fa Zhou:
Practical Aspects of Declarative Languages - 14th International Symposium, PADL 2012, Philadelphia, PA, USA, January 23-24, 2012. Proceedings. Lecture Notes in Computer Science 7149, Springer 2012, ISBN 978-3-642-27693-4 [contents]
Informal and Other Publications
- 2020
- [i11]Neng-Fa Zhou:
Yet Another Comparison of SAT Encodings for the At-Most-K Constraint. CoRR abs/2005.06274 (2020) - 2015
- [i10]Neng-Fa Zhou, Roman Barták, Agostino Dovier:
Planning as Tabled Logic Programming. CoRR abs/1507.03979 (2015) - 2014
- [i9]Roman Barták, Neng-Fa Zhou:
Using Tabled Logic Programming to Solve the Petrobras Planning Problem. CoRR abs/1405.2501 (2014) - [i8]Neng-Fa Zhou:
Combinatorial Search With Picat. CoRR abs/1405.2538 (2014) - 2013
- [i7]Neng-Fa Zhou, Jonathan Fruhman:
Toward a Dynamic Programming Solution for the 4-peg Tower of Hanoi Problem with Configurations. CoRR abs/1301.7673 (2013) - 2012
- [i6]Neng-Fa Zhou, Christian Theil Have:
Efficient Tabling of Structured Data with Enhanced Hash-Consing. CoRR abs/1210.1611 (2012) - 2011
- [i5]Neng-Fa Zhou:
The Language Features and Architecture of B-Prolog. CoRR abs/1103.0812 (2011) - 2010
- [i4]Germán Vidal, Neng-Fa Zhou:
Proceedings of CICLOPS-WLPE 2010. CoRR abs/1009.4020 (2010) - 2007
- [i3]Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen:
Linear Tabling Strategies and Optimizations. CoRR abs/0705.3468 (2007) - 2005
- [i2]Neng-Fa Zhou:
Programming Finite-Domain Constraint Propagators in Action Rules. CoRR abs/cs/0506005 (2005) - 2000
- [i1]Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You, Neng-Fa Zhou:
Linear Tabulated Resolution Based on Prolog Control Strategy. CoRR cs.AI/0003046 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 01:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
