Neng-Fa Zhou

Publications96
h-index17
Citations892
Highly Influential Citations58
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • R. Barták
  • 284 Publications • 2,891 Citations
  • Taisuke Sato
  • 143 Publications • 3,806 Citations
  • Ariel Felner
  • 193 Publications • 5,376 Citations
  • Peter James Stuckey
  • 552 Publications • 13,842 Citations
  • Publications
  • Influence
Implementation of a Linear Tabling Mechanism
TLDR
The implementation of a linear tabling mechanism that lets a call execute from the backtracking point of a former variant call if such a call exists is presented and it is found that re-computation can be avoided for a large portion of calls of directly-recursive tabled predicates.
The language features and architecture of B-Prolog
  • Neng-Fa Zhou
  • Computer Science
    Theory and Practice of Logic Programming
  • 3 March 2011
TLDR
An overview of the language features and a detailed description of the TOAM Jr. architecture are given, including architectural support for action rules and tabling.
Constraint Solving and Planning with Picat
This book introduces a new logic-based multi-paradigm programming language that integrates logic programming, functional programming, dynamic programming with tabling, and scripting, for use in…
Generative Modeling with Failure in PRISM
TLDR
This paper enhances the modeling power of PRISM by allowing general PRISM programs to fail in the generation process of observable events and proposes a three valued probabilistic semantics.
Toward a High-performance System for Symbolic and Statistical Modeling
TLDR
A state-of-the-art implementation of PRISM, a language based on Prolog that supports statistical modeling and learning that is being applied to several problem domains ranging from statistical language processing, decision support, to game analysis.
Linear tabling strategies and optimizations
TLDR
This article describes two strategies of linear tabling, namely, lazy and eager strategies, and compares them both qualitatively and quantitatively, and indicates that, while the lazy strategy has good locality and is well suited for finding all solutions, the eager strategy is comparable in speed with the lazy Strategy and isWell suited for programs with cuts.
Global Optimizations in a Prolog Compiler for the TOAM
Mode-Directed Tabling for Dynamic Programming, Machine Learning, and Constraint Solving
TLDR
Three application examples of mode-directed tabling are presented, namely, (1) hydraulic system planning, a dynamic programming problem, (2) the Viterbi algorithm in PRISM, a probabilistic logic reasoning and learning system, and (3) constraint checking in evaluating Answer Set Programs (ASP).
Programming finite-domain constraint propagators in Action Rules
  • Neng-Fa Zhou
  • Computer Science
    Theory and Practice of Logic Programming
  • 1 June 2005
TLDR
This paper proposes a new language, called AR (Action Rules), and describes how various propagators for finite-domain constraints can be implemented in it, and presents a weak arc-consistency propagator for the all_distinct constraint and a hybrid algorithm for n-ary linear equality constraints.
Robust Multi-Agent Path Finding and Executing
TLDR
This work introduces the notion of a k-robust MAPF plan, which is a plan that can be executed even if a limited number of delays occur, and proposes several robust execution policies.
...
1
2
3
4
5
...