Towards Ranking-based Semantics for Abstract Argumentation using Conditional Logic Semantics

• URL: http://arxiv.org/abs/2008.02735v1
• Date: Wed, 5 Aug 2020 08:34:16 GMT
• Title: Towards Ranking-based Semantics for Abstract Argumentation using Conditional Logic Semantics
• Authors: Kenneth Skiba and Matthias Thimm
• Abstract summary: We propose a novel ranking-based semantics for Dung-style argumentation frameworks. Using an intuitive translation for an argumentation framework to generate conditionals, we can apply nonmonotonic inference systems to generate a ranking on possible worlds.
• Score: 8.619759570837951
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a novel ranking-based semantics for Dung-style argumentation frameworks with the help of conditional logics. Using an intuitive translation for an argumentation framework to generate conditionals, we can apply nonmonotonic inference systems to generate a ranking on possible worlds. With this ranking we construct a ranking for our arguments. With a small extension to this ranking-based semantics we already satisfy some desirable properties for a ranking over arguments.

Related papers

• SHINE: Saliency-aware HIerarchical NEgative Ranking for Compositional Temporal Grounding [52.98133831401225]
  Temporal grounding, also known as video moment retrieval, aims at locating video segments corresponding to a given query sentence. We propose a large language model-driven method for negative query construction, utilizing GPT-3.5-Turbo. We introduce a coarse-to-fine saliency ranking strategy, which encourages the model to learn the multi-granularity semantic relationships between videos and hierarchical negative queries.
  arXiv  Detail & Related papers  (2024-07-06T16:08:17Z)
• Discussion Graph Semantics of First-Order Logic with Equality for Reasoning about Discussion and Argumentation [0.9790236766474198]
  We formulate discussion graph semantics of first-order logic with equality for reasoning about discussion and argumentation. We achieve the generality through a top-down formulation of the semantics of first-order logic (with equality) formulas.
  arXiv  Detail & Related papers  (2024-06-18T00:32:00Z)
• Hierarchical Indexing for Retrieval-Augmented Opinion Summarization [60.5923941324953]
  We propose a method for unsupervised abstractive opinion summarization that combines the attributability and scalability of extractive approaches with the coherence and fluency of Large Language Models (LLMs) Our method, HIRO, learns an index structure that maps sentences to a path through a semantically organized discrete hierarchy. At inference time, we populate the index and use it to identify and retrieve clusters of sentences containing popular opinions from input reviews.
  arXiv  Detail & Related papers  (2024-03-01T10:38:07Z)
• 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)
• Ranking-based Argumentation Semantics Applied to Logical Argumentation (full version) [2.9005223064604078]
  We investigate the behaviour of ranking-based semantics for structured argumentation. We show that a wide class of ranking-based semantics gives rise to so-called culpability measures.
  arXiv  Detail & Related papers  (2023-07-31T15:44:33Z)
• RankCSE: Unsupervised Sentence Representations Learning via Learning to Rank [54.854714257687334]
  We propose a novel approach, RankCSE, for unsupervised sentence representation learning. It incorporates ranking consistency and ranking distillation with contrastive learning into a unified framework. An extensive set of experiments are conducted on both semantic textual similarity (STS) and transfer (TR) tasks.
  arXiv  Detail & Related papers  (2023-05-26T08:27:07Z)
• Many-valued Argumentation, Conditionals and a Probabilistic Semantics for Gradual Argumentation [3.9571744700171743]
  We propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. As a proof of concept, in the finitely-valued case, an Answer set Programming approach is proposed for conditional reasoning. The paper also develops and discusses a probabilistic semantics for gradual argumentation, which builds on the many-valued conditional semantics.
  arXiv  Detail & Related papers  (2022-12-14T22:10:46Z)
• The Inverse Problem for Argumentation Gradual Semantics [8.860629791560198]
  A sub-class of such semantics, the so-called weighted semantics, takes an initial set of weights over the arguments as input. We consider the inverse problem over such weighted semantics. That is, given an argumentation framework and a desired argument ranking, we ask whether there exist initial weights such that a particular semantics produces the given ranking.
  arXiv  Detail & Related papers  (2022-02-01T09:46:23Z)
• 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)
• Superposition with Lambdas [59.87497175616048]
  We design a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $betaeta$-equivalence classes of $lambda$-terms and rely on higher-order unification to achieve refutational completeness.
  arXiv  Detail & Related papers  (2021-01-31T13:53:17Z)
• Lexicographic Logic: a Many-valued Logic for Preference Representation [1.5484595752241122]
  We propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences. We argue that the new logic is an effective formalism for ranking query results according to the satisfaction level of user preferences.
  arXiv  Detail & Related papers  (2020-12-20T14:42:04Z)

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.