Encoding argument graphs in logic

International audienceArgument graphs are a common way to model argumentative reasoning. For reasoning or computational purposes, such graphs may have to be encoded in a given logic. This paper aims at providing a systematic approach for this encoding. This approach relies upon a general, principle-based characterization of argumentation semantics

Computing Consensus: A Logic for Reasoning About Deliberative Processes Based on Argumentation

Argumentation theory can encode an agent’s assessment of the state of an exchange of points of view. We present a conservative model of multiple agents potentially disagreeing on the views presented during a process of deliberation. We model this process as iteratively adding points of view (arguments), or aspects of points of view. This gives rise to a modal logic, deliberative dynamic logic, which permits us to reason about the possible developments of the deliberative state. The logic we propose applies to all natural semantics of argumentation theory. Furthermore, under a very weak assumption that the consensus considered by a group of agents is faithful to their individual views, we show that model checking these models is feasible, as long as the argumentation frameworks, which may be infinite, does not have infinite branching.acceptedVersio

Service Robots in the Hospitality Industry: An Exploratory Literature Review

The service sector is changing drastically due the use of robotics and other technologies, such as Artificial Intelligence (AI), Internet of things (IoT), Big Data and Biometrics. Consequently, further research opportunities in the service industry domain are also expected. In light of the above, the purpose of this paper is to explore the potentialities and limitations of service robots in the hospitality industry. To this end, this paper uses a conceptual approach based on a literature review. As a result, we found that in contexts of high customer contact, service robots should be considered to perform standardized tasks due to social/emotional and cognitive/analytical complexity. The hospitality industry is therefore considered closely related to empathic intelligence, as the integration of service robots has not yet reached the desired stage of service delivery. In a seemingly far-fetched context of our reality, organizations will have to decide whether the AI will allow the complete replacement of humans with robots capable of performing the necessary cognitive and emotional tasks. Or investing in balanced capacities by integrating robot-human systems that seems a reasonable option these days.info:eu-repo/semantics/publishedVersio

Does Coupling Affect the Security of Masked Implementations?

Masking schemes achieve provable security against side-channel analysis by using secret sharing to decorrelate key-dependent intermediate values of the cryptographic algorithm and side-channel information. Masking schemes make assumptions on how the underlying leakage mechanisms of hardware or software behave to account for various physical effects. In this paper, we investigate the effect of the physical placement on the security using leakage assessment on power measurements collected from an FPGA. In order to differentiate other masking failures, we use threshold implementations as masking scheme in conjunction with a high-entropy pseudorandom number generator. We show that we can observe differences in---possibly---exploitable leakage by placing functions corresponding to different shares of a cryptographic implementation in close proximity

Bipolar Argumentation Frameworks, Modal Logic and Semantic Paradoxes

Bipolar Argumentation Frameworks (BAF) are a natural extension of Dung’s Argumentation Frameworks (AF) where a relation of support between arguments is added to the standard attack relation. Despite their interest, BAF present several difficulties and their semantics are quite complex. This paper provides a definition of semantic concepts for BAF in terms of fixpoints of the functions of neutrality and defense, thus preserving most of the fundamental properties of Dung’s AF. From this angle it becomes easy to show that propositional dynamic logic provides an adequate language to talk about BAF. Finally, we illustrate how this framework allows to encode the structure of the referential discourse involved in semantic paradoxes such as the Liar. It turns out that such paradoxes can be seen as BAF without a stable extension.</p