Epistemic Logic Programs: a study of some properties

• URL: http://arxiv.org/abs/2309.16344v1
• Date: Thu, 28 Sep 2023 11:08:37 GMT
• Title: Epistemic Logic Programs: a study of some properties
• Authors: Stefania Costantini, Andrea Formisano
• Abstract summary: 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.
• Score: 4.459996749171579
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Epistemic Logic Programs (ELPs), extend Answer Set Programming (ASP) with epistemic operators. The semantics of such programs is provided in terms of world views, which are sets of belief sets, i.e., syntactically, sets of sets of atoms. Different semantic approaches propose different characterizations of world views. Recent work has introduced semantic properties that should be met by any semantics for ELPs, like the Epistemic Splitting Property, that, if satisfied, allows to modularly compute world views in a bottom-up fashion, analogously to ``traditional'' ASP. We analyze the possibility of changing the perspective, shifting from a bottom-up to a top-down approach to splitting. We propose a basic top-down approach, which we prove to be equivalent to the bottom-up one. We then propose an extended approach, where our new definition: (i) is provably applicable to many of the existing semantics; (ii) operates similarly to ``traditional'' ASP; (iii) provably coincides under any semantics with the bottom-up notion of splitting at least on the class of Epistemically Stratified Programs (which are, intuitively, those where the use of epistemic operators is stratified); (iv) better adheres to common ASP programming methodology.

Related papers

• Learning Visual-Semantic Subspace Representations for Propositional Reasoning [49.17165360280794]
  We propose a novel approach for learning visual representations that conform to a specified semantic structure. Our approach is based on a new nuclear norm-based loss. We show that its minimum encodes the spectral geometry of the semantics in a subspace lattice.
  arXiv  Detail & Related papers  (2024-05-25T12:51:38Z)
• DELPHIC: Practical DEL Planning via Possibilities (Extended Version) [76.75197961194182]
  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.
  arXiv  Detail & Related papers  (2023-07-28T10:09:45Z)
• Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning [79.83792914684985]
  We prove a new identifiability result that provides conditions under which maximally sparse base-predictors yield disentangled representations. Motivated by this theoretical result, we propose a practical approach to learn disentangled representations based on a sparsity-promoting bi-level optimization problem.
  arXiv  Detail & Related papers  (2022-11-26T21:02:09Z)
• Guiding the PLMs with Semantic Anchors as Intermediate Supervision: Towards Interpretable Semantic Parsing [57.11806632758607]
  We propose to incorporate the current pretrained language models with a hierarchical decoder network. By taking the first-principle structures as the semantic anchors, we propose two novel intermediate supervision tasks. We conduct intensive experiments on several semantic parsing benchmarks and demonstrate that our approach can consistently outperform the baselines.
  arXiv  Detail & Related papers  (2022-10-04T07:27:29Z)
• Refining the Semantics of Epistemic Specifications [0.0]
  We focus on the existing semantics approaches, the criteria that a satisfactory semantics is supposed to satisfy, and the ways to improve them. We propose a slightly novel semantics for epistemic ASP, which can be considered as a reflexive extension of Cabalar et al.'s recent formalism called autoepistemic ASP.
  arXiv  Detail & Related papers  (2021-09-17T01:47:19Z)
• Thirty years of Epistemic Specifications [8.339560855135575]
  We extend disjunctive logic programs under the stable model semantics with modal constructs called subjective literals. Using subjective literals, it is possible to check whether a regular literal is true in every or some stable models of the program. Several attempts for capturing the intuitions underlying the language by means of a formal semantics were given.
  arXiv  Detail & Related papers  (2021-08-17T15:03:10Z)
• On the Foundations of Grounding in Answer Set Programming [4.389457090443418]
  We provide a comprehensive elaboration of the theoretical foundations of variable instantiation, or grounding, in Answer Set Programming (ASP) We introduce a formal characterization of grounding algorithms in terms of (fixed point) operators. A major role is played by dedicated well-founded operators whose associated models provide semantic guidance for delineating the result of grounding.
  arXiv  Detail & Related papers  (2021-08-10T16:23:49Z)
• Conflict-driven Inductive Logic Programming [3.29505746524162]
  The goal of Inductive Logic Programming (ILP) is to learn a program that explains a set of examples. Until recently, most research on ILP targeted learning Prolog programs. The ILASP system instead learns Answer Set Programs (ASP)
  arXiv  Detail & Related papers  (2020-12-31T20:24:28Z)
• Infusing Finetuning with Semantic Dependencies [62.37697048781823]
  We show that, unlike syntax, semantics is not brought to the surface by today's pretrained models. We then use convolutional graph encoders to explicitly incorporate semantic parses into task-specific finetuning.
  arXiv  Detail & Related papers  (2020-12-10T01:27:24Z)
• 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)
• A Uniform Treatment of Aggregates and Constraints in Hybrid ASP [9.289905977910378]
  We develop a semantic framework for hybrid ASP solving. We provide aggregate functions for theory variables that adhere to different semantic principles. We show how we can rely on off-the-shelf hybrid solvers for implementation.
  arXiv  Detail & Related papers  (2020-03-09T14:36:11Z)

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.