View in EDS

On the realisability of weak argumentation semantics.

Saved in:
Bibliographic Details
Title: On the realisability of weak argumentation semantics.
Authors: Doukas, Theodoros1 (AUTHOR), Thimm, Matthias1 (AUTHOR)
Source: Journal of Logic & Computation. Dec2025, Vol. 35 Issue 8, p1-41. 41p.
Subjects: Mathematical bounds, Semantics, Systems theory
Abstract: We analyse representatives of the class of non-admissible semantics, particularly the undisputed, strongly undisputed, weakly admissible and weakly preferred semantics, in terms of realisability and their signatures. More specifically, we determine properties of the extension sets they produce, as well as structural features of frameworks that realize extension sets under these semantics. We describe two classes of extension sets for which we show that they are not realisable under undisputed semantics. We also identify approaches that have proven to be useful in the construction of frameworks that aim to realize given extension sets under classical semantics and transfer them to the non-admissible case. While a full characterisation of the signatures of the non-admissible semantics remains elusive, we provide plausible upper bounds and discuss the challenges in establishing concrete lower bounds. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 190650846
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On the realisability of weak argumentation semantics.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Doukas%2C+Theodoros%22">Doukas, Theodoros</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Thimm%2C+Matthias%22">Thimm, Matthias</searchLink><relatesTo>1</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Dec2025, Vol. 35 Issue 8, p1-41. 41p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Mathematical+bounds%22">Mathematical bounds</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Systems+theory%22">Systems theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We analyse representatives of the class of non-admissible semantics, particularly the undisputed, strongly undisputed, weakly admissible and weakly preferred semantics, in terms of realisability and their signatures. More specifically, we determine properties of the extension sets they produce, as well as structural features of frameworks that realize extension sets under these semantics. We describe two classes of extension sets for which we show that they are not realisable under undisputed semantics. We also identify approaches that have proven to be useful in the construction of frameworks that aim to realize given extension sets under classical semantics and transfer them to the non-admissible case. While a full characterisation of the signatures of the non-admissible semantics remains elusive, we provide plausible upper bounds and discuss the challenges in establishing concrete lower bounds. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=190650846
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1093/logcom/exaf058
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 41
        StartPage: 1
    Subjects:
      – SubjectFull: Mathematical bounds
        Type: general
      – SubjectFull: Semantics
        Type: general
      – SubjectFull: Systems theory
        Type: general
    Titles:
      – TitleFull: On the realisability of weak argumentation semantics.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Doukas, Theodoros
      – PersonEntity:
          Name:
            NameFull: Thimm, Matthias
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 0955792X
          Numbering:
            – Type: volume
              Value: 35
            – Type: issue
              Value: 8
          Titles:
            – TitleFull: Journal of Logic & Computation
              Type: main
ResultId 1