Search Results for author:
Found 3 papers, 1 papers with code
Heuristics, Answer Set Programming and Markov Decision Process for Solving a Set of Spatial Puzzles
The goal of this work is to investigate the automated solution of this kind of puzzles adapting an algorithm that combines Answer Set Programming (ASP) with Markov Decision Process (MDP), algorithm oASP(MDP), to use heuristics accelerating the learning process.
A method for the online construction of the set of states of a Markov Decision Process using Answer Set Programming
Non-stationary domains, that change in unpredicted ways, are a challenge for agents searching for optimal policies in sequential decision-making problems.
Answer Set Programming for Non-Stationary Markov Decision Processes
Non-stationary domains, where unforeseen changes happen, present a challenge for agents to find an optimal policy for a sequential decision making problem.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
