• Publications
  • Influence
Implementation of a Linear Tabling Mechanism
Delaying-based tabling mechanisms, such as the one adopted in XSB, are non-linear in the sense that the computation state of delayed calls has to be preserved. In this paper, we present theExpand
  • 67
  • 11
  • PDF
The language features and architecture of B-Prolog
  • N. Zhou
  • Computer Science
  • Theory Pract. Log. Program.
  • 3 March 2011
B-Prolog is a high-performance implementation of the standard Prolog language with several extensions including matching clauses, action rules for event handling, finite-domain constraint solving,Expand
  • 69
  • 6
  • PDF
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 inExpand
  • 32
  • 5
  • PDF
Generative Modeling with Failure in PRISM
PRISM is a logic-based Turing-complete symbolic-statistical modeling language with a built-in parameter learning routine. In this paper,we enhance the modeling power of PRISM by allowing generalExpand
  • 47
  • 4
  • PDF
Toward a High-performance System for Symbolic and Statistical Modeling
We present in this paper a state-of-the-art implementation of PRISM, a language based on Prolog that supports statistical modeling and learning. We start with an interpreter of the language thatExpand
  • 17
  • 4
  • PDF
Linear tabling strategies and optimizations
Recently there has been a growing interest in research in tabling in the logic programming community because of its usefulness in a variety of application domains including program analysis, parsing,Expand
  • 43
  • 3
  • PDF
Global Optimizations in a Prolog Compiler for the TOAM
  • N. Zhou
  • Computer Science
  • J. Log. Program.
  • 1 April 1993
Backtracking in the WAM may be very expensive for some kinds of programs due to the WAM's simple scheme for indexing clauses. Several compilation algorithms have been proposed for constructingExpand
  • 10
  • 3
Mode-Directed Tabling for Dynamic Programming, Machine Learning, and Constraint Solving
Mode-directed tabling amounts to using table modes to control what arguments are used in variant checking of subgoals and how answers are tabled. A mode can be min, max, + (input), (output), or ntExpand
  • 28
  • 2
  • PDF
Programming finite-domain constraint propagators in Action Rules
  • N. Zhou
  • Computer Science
  • Theory Pract. Log. Program.
  • 1 June 2005
In this paper, we propose a new language, called AR (Action Rules), and describe how various propagators for finite-domain constraints can be implemented in it. An action rule specifies a pattern forExpand
  • 39
  • 2
  • PDF
Simulation and Synthesis of Microelectromechanical Systems
  • 15
  • 2