We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from a...
Recently, we have introduced a novel approach to dynamic programming and reinforcement learning that is based on maintaining explicit representations of stationary distributions i...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
In this article, we argue that a program transformation approach is a good way to solve the tyranny of the primary decomposition. We illustrate our transformation-based approach o...
A class of fuzzy linear programming (FLP) problems with fuzzy coefficients based on fuzzy relations is introduced, the concepts of feasible and (, )-maximal and minimal solutions ...