1,720,993 research outputs found
Resource Action-Based Bounded ATL: A New Logic for MAS to Express a Cost Over the Actions
No full textAgreement Games in Multi-Agent Systems
No full textMulti-Agent Systems are composed of distributed intelligent components, known as agents. In real-world scenarios, these agents often lack sufficient resources or access to global system information to achieve their objectives. In such cases, intelligent information sharing can enable agents to collaborate effectively and reach their goals. This work introduces the concept of Agreement Game as a framework to address these challenges
Reasoning about Decidability of Strategic Logics with Imperfect Information and Perfect Recall Strategies
Full text linkIn logics for strategic reasoning the main challenge is represented by their verification in contexts of imperfect information and perfect recall strategies. In this work, we show the combination of two techniques to approximate the verification of Alternating-time Temporal Logic (ATL∗) under imperfect information and perfect recall, which is known to be undecidable. Given a model M and a formula φ, we propose a verification procedure that generates sub-models of M in which each sub-model M′ satisfies a sub-formula φ′ of φ and the verification of φ′ in M′ is decidable. Then, we use CTL∗ model checking to provide a verification result of φ on M. In case the previous step does not give a final result, we exploit a runtime verification mechanism to provide some intermediate result. We prove that our procedure is sound and in the same complexity class of ATL∗ model checking under perfect information and perfect recall. Moreover, we present a tool that uses our procedure and provide experimental results
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Proofs as games and games as proofs : dialogical semantics of logical and natural languages
No full textNotre travail de thèse se situe au carrefour de plusieurs disciplines :d'une part, la logique mathématique et l'informatique théorique, d'autre part le traitement automatique du langage naturel et plus particulièrement la sémantique formelle du langage naturel. Le fil conducteur est la présence constante des méthodes logiques issues de la théorie de la preuve et par le problème philosophique qui a motivé notre thèse : quels sont les liens entre la notion de preuve et celle de signification linguistique ou logique ?Plus concrètement, nous étudions des systèmes formels dont les preuves sont vues comme des stratégies gagnantes pour des jeux à deux joueurs. Dans ces jeux, un jouer, appelé Proposant, essaye de construire une justification pour un certain énoncé tandis que l'autre, l'Opposant, essaye de construire une réfutation de cet énoncé.La thèse est composée de trois parties, chaque partie contenant deux ou trois chapitres.La première partie est propédeutique. Dans les deux chapitres qui la composent nous présentons les outils mathématiques utilisés dans notre thèse ainsi que les principes logiques et philosophiques qui ont guidés nos travaux, notamment la sémantique inférentialiste.La deuxième partie de notre thèse contient deux longs chapitres, lesquels présentent les résultats de théorie de la démonstration qui constituent le cœur de notre thèse.En particulier, dans le premier chapitre de cette partie, nous définissons précisément un système de logique dialogique pour la logique classique du premier ordre avec termes. Nous montrons que, pour une formule A, l'existence d'une stratégie gagnante pour A équivaut au fait que A est une théorème logique. Bien que des systèmes de logique dialogique pour la logique classique du premier ordre existent depuis les années 1960 il n'existait pas à ce jour de preuve convaincante publiée de ce résultat, notamment en présence de termes. Dans le deuxième chapitre de cette deuxième partie, nous présentons une sémantique dénotationnelle pour la variante constructive de la logique modale K. En particulier notre sémantique dénotationnelle est une sémantique des jeux dans laquelle les preuves de la logique modale sont interprétées par des stratégies gagnantes pour des jeux à deux jouer. Nous montrons que notre sémantique possède une propriété remarquable : elle est 'totalement adéquate' (fully complete) c'est-à-dire que toute stratégie gagnante est l'interprétation d'au moins une preuve de la logique modale.La troisième et dernière partie se compose de trois chapitres, chacun étant consacré à une application de nos travaux en théorie de la démonstration à la sémantique du langage naturel.Dans le premier chapitre, nous étudions le rapport entre les analyses syntaxiques catégorielles d'une même phrase et les représentations sémantiques logiques de la phrase analysée. Nous montrons que, lorsque certaines conditions sont respectées, la fonction qui transforme analyses syntaxiques d'une phrase en représentations sémantique logiques est injective.Dans le deuxième chapitre de cette troisième partie nous appliquons notre système de logique dialogique à la résolution au problème de la reconnaissance d'inférences en langage naturel en utilisant un analyseur syntaxique et sémantique catégoriel.Dans le dernier chapitre de cette partie, nous présentons une système formel pour la résolution d'anaphore et ellipses, problème généralement abordé par des méthodes de théorie des modèles. Nous, au contraire, présentons une solution basée sur la théorie de la démonstration, en développant un système de logique dialogique qui permet de résoudre simplement les anaphores et les ellipses.Dans la conclusion, nous faisons le bilan de notre travail de thèse et essayons de décrire les développements futurs possibles de notre recherche, tant du point de vue mathématique et logique que du point de vue des applications au langage naturel.This thesis is situated at the intersection of several disciplines:on the one hand, mathematical logic and theoretical computer science, onthe other hand, natural language processing and formal semantics ofnatural language. The thread tying these topics together is the constant use of tools and methodologies of proof theory and by the philosophical problem that motivated our thesis: what are the links between the notion of proof and that of linguisticmeaning?More concretely, we study formal proofs systems. in these systemsproofs are seen as winning strategies for two-player games. In thegames one player, called the Proponent, tries to construct ajustification for a certain statement while the other, the Opponent,tries to refute this statement.Our thesis is composed of three parts, each part containing a maximum ofthree chapters.The first part is preparatory. In the two chapters that compose it wepresent the mathematical tools used in our thesis as well as thephilosophical question that underlie our research.The second part consists of two long chapters and presents the centralproof-theoretical results of our thesis.n the first chapter of this part we present a dialogical logic systemfor classical first order logic. We show that, given a formula A, A isa logical theorem if and only if there is a proponent winning strategy for A.Dialogical logic systems for classical first-order logic have existedsince the 1960's. However there is no convincing proof of this result inthe literature.In the second chapter of this second part we present a denotationalsemantics for the constructive variant of the modal logic K. Ourdenotational semantics is a game semantics: the proofs of modal logicare interpreted by winning strategies for two-player games. We show thatour game semantics has a remarkable property; it is 'fully complete':every winning strategy is the interpretation of a proof of modal logic.The third and last part of our thesis consists of three chapters. Eachchapter is devoted to an application of proof theory to the semanticsof natural language.In the first chapter, we study the relationship between the categoricalsyntactic analyses of a sentence and the logical representations of thesentence. We show that, when certain conditions are met, the functionthat transforms syntactic analyses of a sentence into logicalrepresentations is injective.In the second chapter of this third part, we use our dialogical logicsystem, together with type logical grammars, to solve textualentailment problems.In the last chapter of this section we present a formal system for theresolution of anaphora and ellipsis. This problem is usually addressedby model-theoretic methods. We, on the contrary, present a solutionbased on proof theory. We develop a dialogical logic system in whichanaphora and ellipsis can be solved in a simple way.In the conclusion, we sketch possible future developments ofour research. Both from a mathematical and logical point of view andfrom the point of view of natural language application
- …
