activity
20142022
most citedPlanning for Goal-Oriented Dialogue Systems

17 citations · 38 across the 9 of their papers we have counts for

collaborators

10 papers

cs.AI2022★ 2 cited

MACQ: A Holistic View of Model Acquisition Techniques

Ethan Callanan, Rebecca De Venezia, Victoria Armstrong +3

For over three decades, the planning community has explored countless methods for data-driven model acquisition. These range in sophistication (e.g., simple set operations to full-…

cs.AI2021★ 6 cited

Classical Planning in Deep Latent Space

Masataro Asai, Hiroshi Kajino, Alex Fukunaga +1

Current domain-independent, classical planners require symbolic models of the problem domain and instance as input, resulting in a knowledge acquisition bottleneck. Meanwhile, alth…

cs.AI2020

Explainability of Intelligent Transportation Systems using Knowledge Compilation: a Traffic Light Controller Case

Salomón Wollenstein-Betech, Christian Muise, Christos G. Cassandras +2

Usage of automated controllers which make decisions on an environment are widespread and are often based on black-box models. We use Knowledge Compilation theory to bring explainab…

cs.AI2019★ 17 cited

Planning for Goal-Oriented Dialogue Systems

Christian Muise, Tathagata Chakraborti, Shubham Agarwal +6

Generating complex multi-turn goal-oriented dialogue agents is a difficult problem that has seen a considerable focus from many leaders in the tech industry, including IBM, Google,…

cs.AI2019

Expectation-Aware Planning: A Unifying Framework for Synthesizing and Executing Self-Explaining Plans for Human-Aware Planning

Sarath Sreedharan, Tathagata Chakraborti, Christian Muise +1

In this work, we present a new planning formalism called Expectation-Aware planning for decision making with humans in the loop where the human's expectations about an agent may di…

cs.AI2019★ 7 cited

Generating Dialogue Agents via Automated Planning

Adi Botea, Christian Muise, Shubham Agarwal +9

Dialogue systems have many applications such as customer support or question answering. Typically they have been limited to shallow single turn interactions. However more advanced…

cs.LO2016

Finite LTL Synthesis is EXPTIME-complete

Jorge A. Baier, Alberto Camacho, Christian Muise +1

LTL synthesis -- the construction of a function to satisfy a logical specification formulated in Linear Temporal Logic -- is a 2EXPTIME-complete problem with relevant applications…

cs.RO2016

Social planning for social HRI

Liz Sonenberg, Tim Miller, Adrian Pearce +3

Making a computational agent 'social' has implications for how it perceives itself and the environment in which it is situated, including the ability to recognise the behaviours of…

cs.AI2015★ 6 cited

Projected Model Counting

Rehan Abdul Aziz, Geoffrey Chu, Christian Muise +1

Model counting is the task of computing the number of assignments to variables V that satisfy a given propositional theory F. Model counting is an essential tool in probabilistic r…

cs.AI2014

Stable Model Counting and Its Application in Probabilistic Logic Programming

Rehan Abdul Aziz, Geoffrey Chu, Christian Muise +1

Model counting is the problem of computing the number of models that satisfy a given propositional theory. It has recently been applied to solving inference tasks in probabilistic…