Search Results for author:
Found 16 papers, 3 papers with code
PRP Rebooted: Advancing the State of the Art in FOND Planning
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.
Automated Planning Techniques for Elementary Proofs in Abstract Algebra
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.
TOBY: A Tool for Exploring Data in Academic Survey Papers
This paper describes TOBY, a visualization tool that helps a user explore the contents of an academic survey paper.
MACQ: A Holistic View of Model Acquisition Techniques
For over three decades, the planning community has explored countless methods for data-driven model acquisition.
Efficient Multi-agent Epistemic Planning: Teaching Planners About Nested Belief
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.
A Permutation-Invariant Representation of Neural Networks with Neuron Embeddings
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.
Classical Planning in Deep Latent Space
Current domain-independent, classical planners require symbolic models of the problem domain and instance as input, resulting in a knowledge acquisition bottleneck.
Explainability of Intelligent Transportation Systems using Knowledge Compilation: a Traffic Light Controller Case
Usage of automated controllers which make decisions on an environment are widespread and are often based on black-box models.
Learning Neural-Symbolic Descriptive Planning Models via Cube-Space Priors: The Voyage Home (to STRIPS)
We achieved a new milestone in the difficult task of enabling agents to learn about their environment autonomously.
Planning for Goal-Oriented Dialogue Systems
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.
Expectation-Aware Planning: A Unifying Framework for Synthesizing and Executing Self-Explaining Plans for Human-Aware Planning
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.
Generating Dialogue Agents via Automated Planning
Dialogue systems have many applications such as customer support or question answering.
Finite LTL Synthesis is EXPTIME-complete
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.
Social planning for social HRI
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.
Projected Model Counting
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.
Stable Model Counting and Its Application in Probabilistic Logic Programming
Model counting is the problem of computing the number of models that satisfy a given propositional theory.
