25,695 research outputs found

    Inférences réflexives dans la publicité

    Get PDF
    Advertisements are so ubiquitous nowadays that capturing the addressee’s attention and maintaining it long enough for them to be fully processed have become fundamental objectives for advertisers. Employing specific strategies in the design of the advertisement contributes efficiently to achieving these goals, getting the audience not only to attend the stimulus but also to process it in certain ways favourable for the advertiser. We argue that Relevance theory, an approach to communication built on a massively modular view of cognition, offers the right tools to explain the nature of the interpretative processes in verbal comprehension. Knowledge of the relevance-based reflexive inferential procedures involved in utterance interpretation allows advertisers to foresee the addressee’s processing behaviour, giving them the possibility to control it in a such a way that the intended interpretative effects are achieved in the desired way

    Ontologies on the semantic web

    Get PDF
    As an informational technology, the World Wide Web has enjoyed spectacular success. In just ten years it has transformed the way information is produced, stored, and shared in arenas as diverse as shopping, family photo albums, and high-level academic research. The “Semantic Web” was touted by its developers as equally revolutionary but has not yet achieved anything like the Web’s exponential uptake. This 17 000 word survey article explores why this might be so, from a perspective that bridges both philosophy and IT

    Discourse network analysis: policy debates as dynamic networks

    Get PDF
    Political discourse is the verbal interaction between political actors. Political actors make normative claims about policies conditional on each other. This renders discourse a dynamic network phenomenon. Accordingly, the structure and dynamics of policy debates can be analyzed with a combination of content analysis and dynamic network analysis. After annotating statements of actors in text sources, networks can be created from these structured data, such as congruence or conflict networks at the actor or concept level, affiliation networks of actors and concept stances, and longitudinal versions of these networks. The resulting network data reveal important properties of a debate, such as the structure of advocacy coalitions or discourse coalitions, polarization and consensus formation, and underlying endogenous processes like popularity, reciprocity, or social balance. The added value of discourse network analysis over survey-based policy network research is that policy processes can be analyzed from a longitudinal perspective. Inferential techniques for understanding the micro-level processes governing political discourse are being developed

    Anticipation as prediction in the predication of data types

    Get PDF
    Every object in existence has its type. Every subject in language has its predicate. Every intension in logic has its extension. Each therefore has two levels but with the fundamental problem of the relationship between the two. The formalism of set theory cannot guarantee the two are co-extensive. That has to be imposed by the axiom of extensibility, which is inadequate for types as shown by Bertrand Russell's rami ed type theory, for language as by Henri Poincar e's impredication and for intension unless satisfying Port Royal's de nitive concept. An anticipatory system is usually de ned to contain its own future state. What is its type? What is its predicate? What is its extension? Set theory can well represent formally the weak anticipatory system, that is in a model of itself. However we have previously shown that the metaphysics of process category theory is needed to represent strong anticipation. Time belongs to extension not intension. The apparent prediction of strong anticipation is really in the structure of its predication. The typing of anticipation arises from a combination of and | respectively (co) multiplication of the (co)monad induced by adjointness of the system's own process. As a property of cartesian closed categories this predication has signi cance for all typing in general systems theory including even in the de nition of time itself

    Classical Computational Models

    Get PDF
    corecore