DELPHIC: Practical DEL Planning via Possibilities (Extended Version)

• URL: http://arxiv.org/abs/2307.15451v1
• Date: Fri, 28 Jul 2023 10:09:45 GMT
• Title: DELPHIC: Practical DEL Planning via Possibilities (Extended Version)
• Authors: Alessandro Burigana, Paolo Felli and Marco Montali
• Abstract summary: This work aims to push the envelop of practical DEL planning. We propose an equivalent semantics defined using, as main building block, so-called possibilities. To substantiate this claim, we implement both approaches in ASP and we set up an experimental evaluation to compare DELPHIC with the traditional, Kripke-based approach.
• Score: 76.75197961194182
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Dynamic Epistemic Logic (DEL) provides a framework for epistemic planning that is capable of representing non-deterministic actions, partial observability, higher-order knowledge and both factual and epistemic change. The high expressivity of DEL challenges existing epistemic planners, which typically can handle only restricted fragments of the whole framework. The goal of this work is to push the envelop of practical DEL planning, ultimately aiming for epistemic planners to be able to deal with the full range of features offered by DEL. Towards this goal, we question the traditional semantics of DEL, defined in terms on Kripke models. In particular, we propose an equivalent semantics defined using, as main building block, so-called possibilities: non well-founded objects representing both factual properties of the world, and what agents consider to be possible. We call the resulting framework DELPHIC. We argue that DELPHIC indeed provides a more compact representation of epistemic states. To substantiate this claim, we implement both approaches in ASP and we set up an experimental evaluation to compare DELPHIC with the traditional, Kripke-based approach. The evaluation confirms that DELPHIC outperforms the traditional approach in space and time.

Related papers

• Unleashing the Potential of the Diffusion Model in Few-shot Semantic Segmentation [56.87049651707208]
  Few-shot Semantic has evolved into In-context tasks, morphing into a crucial element in assessing generalist segmentation models. Our initial focus lies in understanding how to facilitate interaction between the query image and the support image, resulting in the proposal of a KV fusion method within the self-attention framework. Based on our analysis, we establish a simple and effective framework named DiffewS, maximally retaining the original Latent Diffusion Model's generative framework.
  arXiv  Detail & Related papers  (2024-10-03T10:33:49Z)
• Language Models can Infer Action Semantics for Symbolic Planners from Environment Feedback [26.03718733867297]
  We propose Predicting Semantics of Actions with Language Models (PSALM) PSALM learns action semantics by leveraging the strengths of both symbolic planners and Large Language Models (LLMs) Experiments show PSALM boosts plan success rate from 36.4% (on Claude-3.5) to 100%, and explores the environment more efficiently than prior work to infer ground truth domain action semantics.
  arXiv  Detail & Related papers  (2024-06-04T21:29:56Z)
• A Principled Framework for Knowledge-enhanced Large Language Model [58.1536118111993]
  Large Language Models (LLMs) are versatile, yet they often falter in tasks requiring deep and reliable reasoning. This paper introduces a rigorously designed framework for creating LLMs that effectively anchor knowledge and employ a closed-loop reasoning process.
  arXiv  Detail & Related papers  (2023-11-18T18:10:02Z)
• Constrained Bayesian Optimization with Adaptive Active Learning of Unknown Constraints [10.705151736050967]
  optimizing objectives under constraints is a common scenario in real-world applications such as scientific experimental design, design of medical therapies, and industrial process optimization. We propose an efficient CBO framework that intersects the ROIs identified from each aspect to determine the general ROI. We showcase the efficiency and robustness of our proposed CBO framework through empirical evidence and discuss the fundamental challenge of deriving practical regret bounds for CBO algorithms.
  arXiv  Detail & Related papers  (2023-10-12T22:32:00Z)
• Epistemic Logic Programs: a study of some properties [4.459996749171579]
  Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with epistemic operators. Recent work has introduced semantic properties that should be met by any semantics for ELPs. We analyze the possibility of changing the perspective, shifting from a bottom-up to a top-down approach to splitting.
  arXiv  Detail & Related papers  (2023-09-28T11:08:37Z)
• A Semantic Approach to Decidability in Epistemic Planning (Extended Version) [72.77805489645604]
  We use a novel semantic approach to achieve decidability. Specifically, we augment the logic of knowledge S5$_n$ and with an interaction axiom called (knowledge) commutativity. We prove that our framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
  arXiv  Detail & Related papers  (2023-07-28T11:26:26Z)
• The efficacy of Neural Planning Metrics: A meta-analysis of PKL on nuScenes [77.83263286776938]
  A high-performing object detection system plays a crucial role in autonomous driving (AD) The performance, typically evaluated in terms of mean Average Precision, does not take into account orientation and distance of the actors in the scene. Recently, Philion et al. proposed a neural planning metric (PKL), based on the KL divergence of a planner's trajectory and the groundtruth route.
  arXiv  Detail & Related papers  (2020-10-19T09:32:48Z)
• 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)
• Goal-Directed Planning for Habituated Agents by Active Inference Using a Variational Recurrent Neural Network [5.000272778136268]
  This study shows that the predictive coding (PC) and active inference (AIF) frameworks can develop better generalization by learning a prior distribution in a low dimensional latent state space. In our proposed model, learning is carried out by inferring optimal latent variables as well as synaptic weights for maximizing the evidence lower bound. Our proposed model was evaluated with both simple and complex robotic tasks in simulation, which demonstrated sufficient generalization in learning with limited training data.
  arXiv  Detail & Related papers  (2020-05-27T06:43:59Z)

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.