Ferreira L.A.C. Bianchi R.A.Santos P.E.de Mantaras R.L.2019-08-192019-08-192017Anjoletto, L.; Bianchi; Santos, Paulo; De MANTARAS, R. L.. Answer Set Programming for Non-Stationary Markov Decision Processes. APPLIED INTELLIGENCE, v. 1, p. 1, 2017.1573-7497https://repositorio.fei.edu.br/handle/FEI/1210© 2017, Springer Science+Business Media New York.Non-stationary domains, where unforeseen changes happen, present a challenge for agents to find an optimal policy for a sequential decision making problem. This work investigates a solution to this problem that combines Markov Decision Processes (MDP) and Reinforcement Learning (RL) with Answer Set Programming (ASP) in a method we call ASP(RL). In this method, Answer Set Programming is used to find the possible trajectories of an MDP, from where Reinforcement Learning is applied to learn the optimal policy of the problem. Results show that ASP(RL) is capable of efficiently finding the optimal solution of an MDP representing non-stationary domains.Acesso RestritoArtigo10.1007/s10489-017-0988-yAction languagesAnswer set programmingMarkov decision processesNon-determinism