no code implementations • 18 Dec 2023 • Christian Muise, Sheila A. McIlraith, J. Christopher Beck
Fully Observable Non-Deterministic (FOND) planning is a variant of classical symbolic planning in which actions are nondeterministic, with an action's outcome known only upon execution.
no code implementations • 11 Dec 2023 • Alice Petrov, Christian Muise
This paper explores the application of automated planning to automated theorem proving, which is a branch of automated reasoning concerned with the development of algorithms and computer programs to construct mathematical proofs.
1 code implementation • 13 Jun 2023 • Tathagata Chakraborti, Jungkoo Kang, Christian Muise, Sarath Sreedharan, Michael Walker, Daniel Szafir, Tom Williams
This paper describes TOBY, a visualization tool that helps a user explore the contents of an academic survey paper.
1 code implementation • 14 Jun 2022 • Ethan Callanan, Rebecca De Venezia, Victoria Armstrong, Alison Paredes, Tathagata Chakraborti, Christian Muise
For over three decades, the planning community has explored countless methods for data-driven model acquisition.
no code implementations • 6 Oct 2021 • Christian Muise, Vaishak Belle, Paolo Felli, Sheila Mcilraith, Tim Miller, Adrian R. Pearce, Liz Sonenberg
Many AI applications involve the interaction of multiple autonomous agents, requiring those agents to reason about their own beliefs, as well as those of other agents.
no code implementations • 29 Sep 2021 • Ryan Zhou, Christian Muise, Ting Hu
A key property of this representation is that there are multiple representations of a network which can be obtained by permuting the order of the neurons.
1 code implementation • 30 Jun 2021 • Masataro Asai, Hiroshi Kajino, Alex Fukunaga, Christian Muise
Current domain-independent, classical planners require symbolic models of the problem domain and instance as input, resulting in a knowledge acquisition bottleneck.
no code implementations • 9 Jul 2020 • Salomón Wollenstein-Betech, Christian Muise, Christos G. Cassandras, Ioannis Ch. Paschalidis, Yasaman Khazaeni
Usage of automated controllers which make decisions on an environment are widespread and are often based on black-box models.
no code implementations • 27 Apr 2020 • Masataro Asai, Christian Muise
We achieved a new milestone in the difficult task of enabling agents to learn about their environment autonomously.
no code implementations • 17 Oct 2019 • Christian Muise, Tathagata Chakraborti, Shubham Agarwal, Ondrej Bajgar, Arunima Chaudhary, Luis A. Lastras-Montano, Josef Ondrej, Miroslav Vodolan, Charlie Wiecha
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, Amazon, and Microsoft.
no code implementations • 18 Mar 2019 • Sarath Sreedharan, Tathagata Chakraborti, Christian Muise, Subbarao Kambhampati
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 differ from the agent's own model.
no code implementations • 2 Feb 2019 • Adi Botea, Christian Muise, Shubham Agarwal, Oznur Alkan, Ondrej Bajgar, Elizabeth Daly, Akihiro Kishimoto, Luis Lastras, Radu Marinescu, Josef Ondrej, Pablo Pedemonte, Miroslav Vodolan
Dialogue systems have many applications such as customer support or question answering.
no code implementations • 14 Sep 2016 • Jorge A. Baier, Alberto Camacho, Christian Muise, Sheila A. McIlraith
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 in controller synthesis and a myriad of artificial intelligence applications.
no code implementations • 21 Feb 2016 • Liz Sonenberg, Tim Miller, Adrian Pearce, Paolo Felli, Christian Muise, Frank Dignum
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 others.
no code implementations • 28 Jul 2015 • Rehan Abdul Aziz, Geoffrey Chu, Christian Muise, Peter Stuckey
The task is to compute the number of assignments to P such that there exists an extension to 'non-priority' variables V\P that satisfies F. Projected model counting arises when some parts of the model are irrelevant to the counts, in particular when we require additional variables to model the problem we are counting in SAT.
no code implementations • 20 Nov 2014 • Rehan Abdul Aziz, Geoffrey Chu, Christian Muise, Peter Stuckey
Model counting is the problem of computing the number of models that satisfy a given propositional theory.