Determining ActionReversibility in STRIPS Using Answer Set and Epistemic
Logic Programming
- URL: http://arxiv.org/abs/2108.05428v1
- Date: Wed, 11 Aug 2021 20:00:34 GMT
- Title: Determining ActionReversibility in STRIPS Using Answer Set and Epistemic
Logic Programming
- Authors: Wolfgang Faber, Michael Morak, and Luk\'a\v{s} Chrpa
- Abstract summary: We call an action reversible when its effects can be reverted by applying other actions, returning to the original state.
We propose several solutions to the computational problem of deciding the reversibility of an action.
- Score: 8.585348089298133
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: In the context of planning and reasoning about actions and change, we call an
action reversible when its effects can be reverted by applying other actions,
returning to the original state. Renewed interest in this area has led to
several results in the context of the PDDL language, widely used for describing
planning tasks.
In this paper, we propose several solutions to the computational problem of
deciding the reversibility of an action. In particular, we leverage an existing
translation from PDDL to Answer Set Programming (ASP), and then use several
different encodings to tackle the problem of action reversibility for the
STRIPS fragment of PDDL. For these, we use ASP, as well as Epistemic Logic
Programming (ELP), an extension of ASP with epistemic operators, and compare
and contrast their strengths and weaknesses.
Under consideration for acceptance in TPLP.
Related papers
- Fine-Tuning Large Vision-Language Models as Decision-Making Agents via Reinforcement Learning [79.38140606606126]
We propose an algorithmic framework that fine-tunes vision-language models (VLMs) with reinforcement learning (RL)
Our framework provides a task description and then prompts the VLM to generate chain-of-thought (CoT) reasoning.
We demonstrate that our proposed framework enhances the decision-making capabilities of VLM agents across various tasks.
arXiv Detail & Related papers (2024-05-16T17:50:19Z) - Learning Logic Specifications for Policy Guidance in POMDPs: an
Inductive Logic Programming Approach [57.788675205519986]
We learn high-quality traces from POMDP executions generated by any solver.
We exploit data- and time-efficient Indu Logic Programming (ILP) to generate interpretable belief-based policy specifications.
We show that learneds expressed in Answer Set Programming (ASP) yield performance superior to neural networks and similar to optimal handcrafted task-specifics within lower computational time.
arXiv Detail & Related papers (2024-02-29T15:36:01Z) - Plug-and-Play Policy Planner for Large Language Model Powered Dialogue
Agents [121.46051697742608]
We introduce a new dialogue policy planning paradigm to strategize dialogue problems with a tunable language model plug-in named PPDPP.
Specifically, we develop a novel training framework to facilitate supervised fine-tuning over available human-annotated data.
PPDPP consistently and substantially outperforms existing approaches on three different proactive dialogue applications.
arXiv Detail & Related papers (2023-11-01T03:20:16Z) - DisasterResponseGPT: Large Language Models for Accelerated Plan of
Action Development in Disaster Response Scenarios [3.42658286826597]
This study presents DisasterResponseGPT, an algorithm that leverages Large Language Models (LLMs) to generate valid plans of action quickly.
The proposed method generates multiple plans within seconds, which can be further refined following the user's feedback.
Preliminary results indicate that the plans of action developed by DisasterResponseGPT are comparable to human-generated ones while offering greater ease of modification in real-time.
arXiv Detail & Related papers (2023-06-29T19:24:19Z) - Inverse Online Learning: Understanding Non-Stationary and Reactionary
Policies [79.60322329952453]
We show how to develop interpretable representations of how agents make decisions.
By understanding the decision-making processes underlying a set of observed trajectories, we cast the policy inference problem as the inverse to this online learning problem.
We introduce a practical algorithm for retrospectively estimating such perceived effects, alongside the process through which agents update them.
Through application to the analysis of UNOS organ donation acceptance decisions, we demonstrate that our approach can bring valuable insights into the factors that govern decision processes and how they change over time.
arXiv Detail & Related papers (2022-03-14T17:40:42Z) - Reactive Answer Set Programming [2.7286395031146062]
Logic Production System (LPS) is a logic-based framework for modelling reactive behaviour.
This paper proposes a systematic mapping of the Kernel of this framework (called KELPS) into an answer set program (ASP)
arXiv Detail & Related papers (2021-09-22T10:10:14Z) - Planning with Incomplete Information in Quantified Answer Set
Programming [1.3501640559999886]
We present a general approach to planning with incomplete information in Answer Set Programming (ASP)
We represent planning problems using a simple formalism where logic programs describe the transition function between states.
We present a translation-based QASP solver that converts quantified logic programs into QBFs and then executes a QBF solver.
arXiv Detail & Related papers (2021-08-13T21:24:47Z) - Harnessing Incremental Answer Set Solving for Reasoning in
Assumption-Based Argumentation [1.5469452301122177]
Assumption-based argumentation (ABA) is a central structured argumentation formalism.
Recent advances in answer set programming (ASP) enable efficiently solving NP-hard reasoning tasks of ABA in practice.
arXiv Detail & Related papers (2021-08-09T17:34:05Z) - SML: a new Semantic Embedding Alignment Transformer for efficient
cross-lingual Natural Language Inference [71.57324258813674]
The ability of Transformers to perform with precision a variety of tasks such as question answering, Natural Language Inference (NLI) or summarising, have enable them to be ranked as one of the best paradigms to address this kind of tasks at present.
NLI is one of the best scenarios to test these architectures, due to the knowledge required to understand complex sentences and established a relation between a hypothesis and a premise.
In this paper, we propose a new architecture, siamese multilingual transformer, to efficiently align multilingual embeddings for Natural Language Inference.
arXiv Detail & Related papers (2021-03-17T13:23:53Z) - Modelling Multi-Agent Epistemic Planning in ASP [66.76082318001976]
This paper presents an implementation of a multi-shot Answer Set Programming-based planner that can reason in multi-agent epistemic settings.
The paper shows how the planner, exploiting an ad-hoc epistemic state representation and the efficiency of ASP solvers, has competitive performance results on benchmarks collected from the literature.
arXiv Detail & Related papers (2020-08-07T06:35:56Z) - selp: A Single-Shot Epistemic Logic Program Solver [19.562205966997947]
Epistemic Logic Programs (ELPs) are an extension of Answer Set Programming (ASP)
We show that there also exists a direct translation from ELPs into non-ground ASP with bounded arity.
We then implement this encoding method, using recently proposed techniques to handle large, non-ground ASP rules, into the prototype ELP solving system "selp"
arXiv Detail & Related papers (2020-01-04T15:36:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.