A Uniform Treatment of Aggregates and Constraints in Hybrid ASP

• URL: http://arxiv.org/abs/2003.04176v2
• Date: Fri, 13 Mar 2020 12:42:54 GMT
• Title: A Uniform Treatment of Aggregates and Constraints in Hybrid ASP
• Authors: Pedro Cabalar and Jorge Fandinno and Torsten Schaub and Philipp Wanko
• Abstract summary: 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.
• Score: 9.289905977910378
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Characterizing hybrid ASP solving in a generic way is difficult since one needs to abstract from specific theories. Inspired by lazy SMT solving, this is usually addressed by treating theory atoms as opaque. Unlike this, we propose a slightly more transparent approach that includes an abstract notion of a term. Rather than imposing a syntax on terms, we keep them abstract by stipulating only some basic properties. With this, we further develop a semantic framework for hybrid ASP solving and provide aggregate functions for theory variables that adhere to different semantic principles, show that they generalize existing aggregate semantics in ASP and how we can rely on off-the-shelf hybrid solvers for implementation.

Related papers

• Spatial Semantic Recurrent Mining for Referring Image Segmentation [63.34997546393106]
  We propose Stextsuperscript2RM to achieve high-quality cross-modality fusion. It follows a working strategy of trilogy: distributing language feature, spatial semantic recurrent coparsing, and parsed-semantic balancing. Our proposed method performs favorably against other state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2024-05-15T00:17:48Z)
• Sparsity-Guided Holistic Explanation for LLMs with Interpretable Inference-Time Intervention [53.896974148579346]
  Large Language Models (LLMs) have achieved unprecedented breakthroughs in various natural language processing domains. The enigmatic black-box'' nature of LLMs remains a significant challenge for interpretability, hampering transparent and accountable applications. We propose a novel methodology anchored in sparsity-guided techniques, aiming to provide a holistic interpretation of LLMs.
  arXiv  Detail & Related papers  (2023-12-22T19:55:58Z)
• A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming [14.342696862884704]
  We introduce a novel relativized equivalence notion, which is able to capture all related notions from the literature. We then introduce an operator that combines projection and a relaxation of (SP)-forgetting to obtain the relativized simplifications.
  arXiv  Detail & Related papers  (2023-12-13T09:05:48Z)
• 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)
• Universal Information Extraction as Unified Semantic Matching [54.19974454019611]
  We decouple information extraction into two abilities, structuring and conceptualizing, which are shared by different tasks and schemas. Based on this paradigm, we propose to universally model various IE tasks with Unified Semantic Matching framework. In this way, USM can jointly encode schema and input text, uniformly extract substructures in parallel, and controllably decode target structures on demand.
  arXiv  Detail & Related papers  (2023-01-09T11:51:31Z)
• 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)
• Towards a Semantics for Hybrid ASP systems [9.143661393612927]
  We introduce the concept of abstract and structured theories that allow us to formally elaborate upon their integration with ASP. We then use this concept to make precise the semantic characterization of CLINGO's theory-reasoning framework and establish its correspondence to the logic of Here-and-there with constraints.
  arXiv  Detail & Related papers  (2021-08-06T11:21:50Z)
• Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory [1.295566630218982]
  We introduce the notion of a ternary satisfaction relation and define stable semantics in terms of it. We show that ternary satisfaction relations bridge the gap between the standard Gelfond-Lifschitz reduct, and stable semantics as defined in the framework of AFT.
  arXiv  Detail & Related papers  (2021-04-30T07:06:27Z)
• Generalized Inverse Planning: Learning Lifted non-Markovian Utility for Generalizable Task Representation [83.55414555337154]
  In this work, we study learning such utility from human demonstrations. We propose a new quest, Generalized Inverse Planning, for utility learning in this domain. We outline a computational framework, Maximum Entropy Inverse Planning (MEIP), that learns non-Markovian utility and associated concepts in a generative manner.
  arXiv  Detail & Related papers  (2020-11-12T21:06:26Z)
• Invariant Causal Prediction for Block MDPs [106.63346115341862]
  Generalization across environments is critical to the successful application of reinforcement learning algorithms to real-world challenges. We propose a method of invariant prediction to learn model-irrelevance state abstractions (MISA) that generalize to novel observations in the multi-environment setting.
  arXiv  Detail & Related papers  (2020-03-12T21:03:01Z)
• An ASP semantics for Constraints involving Conditional Aggregates [9.289905977910378]
  We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP) We extend its underlying logical framework with aggregate functions over constraint values and variables. We put some emphasis on logic programs with linear constraints and show how common ASP aggregates can be regarded as particular cases of so-called conditional linear constraints.
  arXiv  Detail & Related papers  (2020-02-17T12:25:01Z)

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.