Sciweavers

10871 search results - page 12 / 2175
» A stable programming language
Sort
View
ASP
2003
Springer
14 years 23 days ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
KR
2004
Springer
14 years 27 days ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
NIPS
2007
13 years 9 months ago
Stable Dual Dynamic Programming
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...
ICML
1995
IEEE
14 years 8 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon
ICLP
1992
Springer
13 years 11 months ago
The Stable Models of a Predicate Logic Program
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel