A framework for Conditional Reasoning in Answer Set Programming

• URL: http://arxiv.org/abs/2506.03997v2
• Date: Thu, 03 Jul 2025 12:50:18 GMT
• Title: A framework for Conditional Reasoning in Answer Set Programming
• Authors: Mario Alviano, Laura Giordano, Daniele Theseider Dupré,
• Abstract summary: We introduce a Conditional Answer Set Programming framework (Conditional ASP) for the definition of conditional extensions of Answer Set Programming (ASP)<n>The approach builds on a conditional logic with typicality, and on the combination of a conditional knowledge base with an ASP program, and allows for conditional reasoning over the answer sets of the program.
• Score: 1.228936170812787
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper we introduce a Conditional Answer Set Programming framework (Conditional ASP) for the definition of conditional extensions of Answer Set Programming (ASP). The approach builds on a conditional logic with typicality, and on the combination of a conditional knowledge base with an ASP program, and allows for conditional reasoning over the answer sets of the program. The formalism relies on a multi-preferential semantics (and on the KLM preferential semantics, as a special case) to provide an interpretation of conditionals.

Related papers

• Few-shot Policy (de)composition in Conversational Question Answering [54.259440408606515]
  We propose a neuro-symbolic framework to detect policy compliance using large language models (LLMs) in a few-shot setting.<n>We show that our approach soundly reasons about policy compliance conversations by extracting sub-questions to be answered, assigning truth values from contextual information, and explicitly producing a set of logic statements from the given policies.<n>We apply this approach to the popular PCD and conversational machine reading benchmark, ShARC, and show competitive performance with no task-specific finetuning.
  arXiv  Detail & Related papers  (2025-01-20T08:40:15Z)
• An Encoding of Abstract Dialectical Frameworks into Higher-Order Logic [57.24311218570012]
  This approach allows for the computer-assisted analysis of abstract dialectical frameworks. Exemplary applications include the formal analysis and verification of meta-theoretical properties.
  arXiv  Detail & Related papers  (2023-12-08T09:32:26Z)
• Reasoning over Logically Interacted Conditions for Question Answering [113.9231035680578]
  We study a more challenging task where answers are constrained by a list of conditions that logically interact. We propose a new model, TReasoner, for this challenging reasoning task. TReasoner achieves state-of-the-art performance on two benchmark conditional QA datasets.
  arXiv  Detail & Related papers  (2022-05-25T16:41:39Z)
• A General Framework for Modelling Conditional Reasoning -- Preliminary Report [4.340338299803562]
  We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems. This framework covers the most popular kinds of conditional reasoning in logic-based KR.
  arXiv  Detail & Related papers  (2022-02-15T17:33:39Z)
• Answer Set Programming Made Easy [11.142087388269033]
  We take up an idea from the folklore of Answer Set Programming, namely that choices, integrity constraints along with a restricted rule format is sufficient for Answer Set Programming. We propose a modeling methodology for ASP beginners and illustrate how it can be used.
  arXiv  Detail & Related papers  (2021-11-11T18:27:09Z)
• ConditionalQA: A Complex Reading Comprehension Dataset with Conditional Answers [93.55268936974971]
  We describe a Question Answering dataset that contains complex questions with conditional answers. We call this dataset ConditionalQA. We show that ConditionalQA is challenging for many of the existing QA models, especially in selecting answer conditions.
  arXiv  Detail & Related papers  (2021-10-13T17:16:46Z)
• 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)
• Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures [13.245718532835864]
  Contextualized Knowledge Repository (CKR) is rooted in description logics but links on the reasoning side strongly to logic programs. We present a generalization of CKR hierarchies to multiple contextual relations, along with their interpretation of defeasible axioms and preference. We show that for a relevant fragment of CKR hierarchies with multiple contextual relations, query answering can be realized with the popular asprin framework.
  arXiv  Detail & Related papers  (2021-08-06T13:06:45Z)
• Hierarchical Poset Decoding for Compositional Generalization in Language [52.13611501363484]
  We formalize human language understanding as a structured prediction task where the output is a partially ordered set (poset) Current encoder-decoder architectures do not take the poset structure of semantics into account properly. We propose a novel hierarchical poset decoding paradigm for compositional generalization in language.
  arXiv  Detail & Related papers  (2020-10-15T14:34:26Z)
• The ILASP system for Inductive Learning of Answer Set Programs [79.41112438865386]
  Our system learns Answer Set Programs, including normal rules, choice rules and hard and weak constraints. We first give a general overview of ILASP's learning framework and its capabilities. This is followed by a comprehensive summary of the evolution of the ILASP system.
  arXiv  Detail & Related papers  (2020-05-02T19:04:12Z)
• 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.