Extension-based semantics in abstract argumentation provide a criterion to determine whether a set of arguments is acceptable or not. In this paper, we present the notion of extension-ranking semantics, which determines a preordering over sets of arguments, where one set is deemed more plausible than another if it is somehow more acceptable. We obtain extension-based semantics as a special case of this new approach, but it also allows us to make more fine-grained distinctions, such as one set being "more complete'' or "more admissible'' than another. We define a number of general principles to classify extension-ranking semantics and develop concrete approaches. We also study the relation between extension-ranking semantics and argument-ranking based semantics, which rank individual arguments instead of sets of arguments.

The exact relationship between formal argumentation and nonmonotonic logics is a research topic that keeps on eluding researchers despite recent intensified efforts. We contribute to a deeper understanding of this relation by investigating characterizations of abstract dialectical frameworks in conditional logics for nonmonotonic reasoning. We first show that in general, there is a gap between argumentation and conditional semantics when applying several intuitive translations, but then prove that this gap can be closed when focusing on specific classes of translations.

No abstract

Existing fair exchange protocols usually neglect consideration of cost when assessing their fairness. However, in an environment with non-negligible transaction cost, e.g., public blockchains, high or unexpected transaction cost might be an obstacle for wide-spread adoption of fair exchange protocols in business applications. For example, as of 2021-12-17, the initialization of the FairSwap protocol on the Ethereum blockchain requires the selling party to pay a fee of approx. 349.20 USD per exchange. We address this issue by defining cost fairness, which can be used to assess two-party exchange protocols including implied transaction cost. We show that in an environment with non-negligible transaction cost where one party has to initialize the exchange protocol and the other party can leave the exchange at any time cost fairness cannot be achieved.

No abstract

No abstract

In abstract argumentation, the admissible semantics can be said to distinguish the preferred semantics in the sense that argumentation frameworks with the same admissible extensions also have the same preferred extensions. In this paper we present an exhaustive study of such distinguishability relationships, including those between sets of semantics. We further examine restricted classes of argumentation frameworks, such as self-attack-free and acyclic frameworks. We discuss the relevance of our results in the context of the argumentation framework elicitation problem.

The article discusses the advantages of using an acoustic camera to analyze noise distribution. Location of noise sources was based on example of an autogyro model. Tests were performed using a 16-microphone acoustic camera using Noise Inspector software. Acoustic maps and sound power levels for two aircraft operations conditions were obtained. The results obtained during the various states of the model work were compared.