6,764 research outputs found

    Preservation of Semantic Properties during the Aggregation of Abstract Argumentation Frameworks

    Get PDF
    An abstract argumentation framework can be used to model the argumentative stance of an agent at a high level of abstraction, by indicating for every pair of arguments that is being considered in a debate whether the first attacks the second. When modelling a group of agents engaged in a debate, we may wish to aggregate their individual argumentation frameworks to obtain a single such framework that reflects the consensus of the group. Even when agents disagree on many details, there may well be high-level agreement on important semantic properties, such as the acceptability of a given argument. Using techniques from social choice theory, we analyse under what circumstances such semantic properties agreed upon by the individual agents can be preserved under aggregation.Comment: In Proceedings TARK 2017, arXiv:1707.0825

    Parametric Connectives in Disjunctive Logic Programming

    Full text link
    Disjunctive Logic Programming (\DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). \DLP is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class \SigmaP{2} (\NP^{\NP}). Importantly, the \DLP encodings are often simple and natural. In this paper, we single out some limitations of \DLP for KRR, which cannot naturally express problems where the size of the disjunction is not known ``a priori'' (like N-Coloring), but it is part of the input. To overcome these limitations, we further enhance the knowledge modelling abilities of \DLP, by extending this language by {\em Parametric Connectives (OR and AND)}. These connectives allow us to represent compactly the disjunction/conjunction of a set of atoms having a given property. We formally define the semantics of the new language, named DLP,DLP^{\bigvee,\bigwedge} and we show the usefulness of the new constructs on relevant knowledge-based problems. We address implementation issues and discuss related works

    Wayne A. Davis, Implicature: Intention, Convention, and Principle in the Failure of Gricean Theory

    Get PDF
    [First Paragraph] In his recent book, Implicature: Intention, Convention, and Principle in the Failure of Gricean Theory (1998), Wayne Davis argues that the Gricean approach to conversational implicature is bankrupt and offers a new approach of his own. Although I disagree with Davis both in general and in detail, I think nonetheless that the problems he raises'or close relatives of them-- are serious and important problems which should give any Gricean pause. This is an extremely worthwhile book, even for those who disagree with it

    Cognitive Approaches to Phenomenal Consciousness

    Get PDF
    The most promising approaches to understanding phenomenal consciousness are what I’ll call cognitive approaches, the most notable exemplars of which are the theories of consciousness articulated by David Rosenthal and Daniel Dennett. The aim of the present contribution is to review the core similarities and differences of these exemplars, as well as to outline the main strengths and remaining challenges to this general sort of approach

    Confidentiality-Preserving Publish/Subscribe: A Survey

    Full text link
    Publish/subscribe (pub/sub) is an attractive communication paradigm for large-scale distributed applications running across multiple administrative domains. Pub/sub allows event-based information dissemination based on constraints on the nature of the data rather than on pre-established communication channels. It is a natural fit for deployment in untrusted environments such as public clouds linking applications across multiple sites. However, pub/sub in untrusted environments lead to major confidentiality concerns stemming from the content-centric nature of the communications. This survey classifies and analyzes different approaches to confidentiality preservation for pub/sub, from applications of trust and access control models to novel encryption techniques. It provides an overview of the current challenges posed by confidentiality concerns and points to future research directions in this promising field

    ZETA - Zero-Trust Authentication: Relying on Innate Human Ability, not Technology

    Get PDF
    Reliable authentication requires the devices and channels involved in the process to be trustworthy; otherwise authentication secrets can easily be compromised. Given the unceasing efforts of attackers worldwide such trustworthiness is increasingly not a given. A variety of technical solutions, such as utilising multiple devices/channels and verification protocols, has the potential to mitigate the threat of untrusted communications to a certain extent. Yet such technical solutions make two assumptions: (1) users have access to multiple devices and (2) attackers will not resort to hacking the human, using social engineering techniques. In this paper, we propose and explore the potential of using human-based computation instead of solely technical solutions to mitigate the threat of untrusted devices and channels. ZeTA (Zero Trust Authentication on untrusted channels) has the potential to allow people to authenticate despite compromised channels or communications and easily observed usage. Our contributions are threefold: (1) We propose the ZeTA protocol with a formal definition and security analysis that utilises semantics and human-based computation to ameliorate the problem of untrusted devices and channels. (2) We outline a security analysis to assess the envisaged performance of the proposed authentication protocol. (3) We report on a usability study that explores the viability of relying on human computation in this context
    corecore