Argumentative Characterizations of (Extended) Disjunctive Logic Programs
- URL: http://arxiv.org/abs/2306.07126v1
- Date: Mon, 12 Jun 2023 14:01:38 GMT
- Title: Argumentative Characterizations of (Extended) Disjunctive Logic Programs
- Authors: Jesse Heyninck and Ofer Arieli
- Abstract summary: We show that assumption-based argumentation can represent not only normal logic programs, but also disjunctive logic programs and their extensions.
We consider some inference rules for disjunction that the core logic of the argumentation frameworks should respect.
- Score: 2.055949720959582
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper continues an established line of research about the relations
between argumentation theory, particularly assumption-based argumentation, and
different kinds of logic programs. In particular, we extend known result of
Caminada, Schultz and Toni by showing that assumption-based argumentation can
represent not only normal logic programs, but also disjunctive logic programs
and their extensions. For this, we consider some inference rules for
disjunction that the core logic of the argumentation frameworks should respect,
and show the correspondence to the handling of disjunctions in the heads of the
logic programs' rules.
Related papers
- Chain of Logic: Rule-Based Reasoning with Large Language Models [10.017812995997753]
Rule-based reasoning enables us to draw conclusions by accurately applying a rule to a set of facts.
We introduce a new prompting method, Chain of Logic, which elicits rule-based reasoning through decomposition and recomposition.
We evaluate chain of logic across eight rule-based reasoning tasks involving three distinct compositional rules from the LegalBench benchmark.
arXiv Detail & Related papers (2024-02-16T01:54:43Z) - 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) - A Unifying Framework for Learning Argumentation Semantics [50.69905074548764]
We present a novel framework, which uses an Inductive Logic Programming approach to learn the acceptability semantics for several abstract and structured argumentation frameworks in an interpretable way.
Our framework outperforms existing argumentation solvers, thus opening up new future research directions in the area of formal argumentation and human-machine dialogues.
arXiv Detail & Related papers (2023-10-18T20:18:05Z) - Modeling Hierarchical Reasoning Chains by Linking Discourse Units and
Key Phrases for Reading Comprehension [80.99865844249106]
We propose a holistic graph network (HGN) which deals with context at both discourse level and word level, as the basis for logical reasoning.
Specifically, node-level and type-level relations, which can be interpreted as bridges in the reasoning process, are modeled by a hierarchical interaction mechanism.
arXiv Detail & Related papers (2023-06-21T07:34:27Z) - Non-Deterministic Approximation Fixpoint Theory and Its Application in
Disjunctive Logic Programming [11.215352918313577]
Approximation fixpoint theory is a framework for studying the semantics of nonmonotonic logics.
We extend AFT to dealing with non-deterministic constructs that allow to handle indefinite information.
The applicability and usefulness of this generalization is illustrated in the context of disjunctive logic programming.
arXiv Detail & Related papers (2022-11-30T18:58:32Z) - Discourse-Aware Graph Networks for Textual Logical Reasoning [142.0097357999134]
Passage-level logical relations represent entailment or contradiction between propositional units (e.g., a concluding sentence)
We propose logic structural-constraint modeling to solve the logical reasoning QA and introduce discourse-aware graph networks (DAGNs)
The networks first construct logic graphs leveraging in-line discourse connectives and generic logic theories, then learn logic representations by end-to-end evolving the logic relations with an edge-reasoning mechanism and updating the graph features.
arXiv Detail & Related papers (2022-07-04T14:38:49Z) - Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical
Perspective [1.160208922584163]
Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing preferential disjunctions.
In this paper we obtain a purely logical characterization of strong equivalence of LPODs as logical equivalence in a four-valued logic.
We provide a new proof of the coNP-completeness of strong equivalence for LPODs, which has an interest in its own right since it relies on the special structure of such programs.
arXiv Detail & Related papers (2022-05-10T13:33:32Z) - A Formalisation of Abstract Argumentation in Higher-Order Logic [77.34726150561087]
We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic.
This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using interactive and automated reasoning tools.
arXiv Detail & Related papers (2021-10-18T10:45:59Z) - On syntactically similar logic programs and sequential decompositions [0.0]
Rule-based reasoning is an essential part of human intelligence prominently formalized in artificial intelligence research via logic programs.
Describing complex objects as the composition of elementary ones is a common strategy in computer science and science in general.
We show how similarity can be used to answer queries across different domains via a one-step reduction.
arXiv Detail & Related papers (2021-09-11T15:22:17Z) - Logic-Driven Context Extension and Data Augmentation for Logical
Reasoning of Text [65.24325614642223]
We propose to understand logical symbols and expressions in the text to arrive at the answer.
Based on such logical information, we put forward a context extension framework and a data augmentation algorithm.
Our method achieves the state-of-the-art performance, and both logic-driven context extension framework and data augmentation algorithm can help improve the accuracy.
arXiv Detail & Related papers (2021-05-08T10:09:36Z)
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.