Reasoning with declarative knowledge (RDK) and sequential decision-making (SDM) are two key research areas in artificial intelligence. RDK methods reason with declarative domain knowledge, including commonsense knowledge, that is either provided a priori or acquired over time, while SDM methods (probabilistic planning and reinforcement learning) seek to compute action policies that maximize the expected cumulative utility over a time horizon; both classes of methods reason in the presence of uncertainty. Despite the rich literature in these two areas, researchers have not fully explored their complementary strengths. In this paper, we survey algorithms that leverage RDK methods while making sequential decisions under uncertainty. We discuss...
Uncertainty quantification is one of the central challenges for machine learning in real-world appli...
International audienceThe goal of this chapter is to provide a general introduction to decision maki...
Methods for learning optimal policies often assume that the way the domain is conceptualised— the p...
This chapter discusses decision making under uncertainty. More specifically, it offers an overview o...
Sequential decision-making under uncertainty is an important branch of artificial intelligence resea...
Sequential decision making under uncertainty problems often deal with partially observable Markov de...
The problem of making decisions is ubiquitous in life. This problem becomes even more complex when t...
Robots frequently face complex tasks that require more than one action, where sequential decision-ma...
This work explores a sequential decision making problem with agents having diverse expertise and mis...
We consider sequential decision making problems under uncertainty, in which a user has a general ide...
AbstractIn this paper we discuss a class of tasks in which to study planning under uncertainty. We a...
In this work we consider probabilistic approaches to sequential decision making. The ultimate goal i...
International audienceWe consider sequential decision making problems under uncertainty , in which a...
Rationally inattentive decision-making (RIDM) extends general problem of Bayesian decision-making un...
In this paper we investigate the notion of legibility in sequential decision tasks under uncertainty...
Uncertainty quantification is one of the central challenges for machine learning in real-world appli...
International audienceThe goal of this chapter is to provide a general introduction to decision maki...
Methods for learning optimal policies often assume that the way the domain is conceptualised— the p...
This chapter discusses decision making under uncertainty. More specifically, it offers an overview o...
Sequential decision-making under uncertainty is an important branch of artificial intelligence resea...
Sequential decision making under uncertainty problems often deal with partially observable Markov de...
The problem of making decisions is ubiquitous in life. This problem becomes even more complex when t...
Robots frequently face complex tasks that require more than one action, where sequential decision-ma...
This work explores a sequential decision making problem with agents having diverse expertise and mis...
We consider sequential decision making problems under uncertainty, in which a user has a general ide...
AbstractIn this paper we discuss a class of tasks in which to study planning under uncertainty. We a...
In this work we consider probabilistic approaches to sequential decision making. The ultimate goal i...
International audienceWe consider sequential decision making problems under uncertainty , in which a...
Rationally inattentive decision-making (RIDM) extends general problem of Bayesian decision-making un...
In this paper we investigate the notion of legibility in sequential decision tasks under uncertainty...
Uncertainty quantification is one of the central challenges for machine learning in real-world appli...
International audienceThe goal of this chapter is to provide a general introduction to decision maki...
Methods for learning optimal policies often assume that the way the domain is conceptualised— the p...