Multiplayer belief revision

One main topic of the epistemic program of game theory deals with the value of information. To study this question in a broad context, one needs to adapt some of the tools used in multiplayer epistemic logic. A hierarchical belief structure is introduced both in a syntactical and semantical framework. In the same framework, a generalized notion of message is characterized by its content and its status. For a given message, a multiplayer belief revision rule that transforms any initial belief structure into a final belief one is designed. A representation theorem relates syntactical axioms to the belief revision rule.Belief revision, message, epistemic logic.

Automatic extraction of knowledge from web documents

A large amount of digital information available is written as text documents in the form of web pages, reports, papers, emails, etc. Extracting the knowledge of interest from such documents from multiple sources in a timely fashion is therefore crucial. This paper provides an update on the Artequakt system which uses natural language tools to automatically extract knowledge about artists from multiple documents based on a predefined ontology. The ontology represents the type and form of knowledge to extract. This knowledge is then used to generate tailored biographies. The information extraction process of Artequakt is detailed and evaluated in this paper

MEDIA EFFECTS ON THE NEW YORK TIMES’ “THE WOMEN’S MARCH IN WASHINGTON” VIDEO NEWS COVERAGE ON FACEBOOK

The reliance towards Facebook in regard to obtaining information becomes a news habit among the society. Considerable number of news coverage from media is accessible to Facebook which creates effects on the audience on account of the media exposure. The study is conducted for the purposes of analyzing news elements which are embedded in The New York Times' “The Women's March in Wahsington”video news coverage on Facebook and discovering the effects of the coverage towards media audience. This study is constructed as a library research which utilizes textual and user-response analysis research methodology. The theory utilizes to support the study is Pan &Kosicki's Framing Analysis, and McComb& Shaw's Agenda-Setting theory is also applied in this study to support the framing analysis. The results of the study indicate that three salient elements of the coverage set public agenda to which the salient elements become prominent issues of the Women's March on Washington

Action Theory Contraction and Minimal Change

Proceedings of the 11th Conference on Principles of Knowledge Representation and Reasoning (KR'08)This work is about changing action domain descriptions in dynamic logic. We here revisit the semantics of action theory contraction, giving more robust operators that express minimal change based on a notion of distance between models. We then define syntactical contraction operators and establish their correctness w.r.t. our semantics. Finally we show that our operators satisfy the PDL-counterpart of the standard postulates for theory change adopted in the literature

A Brief History of Updates of Answer-Set Programs

Funding Information: The authors would like to thank José Alferes, Martin Baláz, Federico Banti, Antonio Brogi, Martin Homola, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski, and Theresa Swift, with whom they worked on the topic of this paper over the years, as well as Ricardo Gonçalves and Matthias Knorr for valuable comments on an earlier draft of this paper. The authors would also like to thank the anonymous reviewers for their insightful comments and suggestions, which greatly helped us improve this paper. The authors were partially supported by Fundação para a Ciência e Tecnologia through projects FORGET (PTDC/CCI-INF/32219/2017) and RIVER (PTDC/CCI-COM/30952/2017), and strategic project NOVA LINCS (UIDB/04516/2020). Publisher Copyright: © The Author(s), 2022. Published by Cambridge University Press.Over the last couple of decades, there has been a considerable effort devoted to the problem of updating logic programs under the stable model semantics (a.k.a. answer-set programs) or, in other words, the problem of characterising the result of bringing up-to-date a logic program when the world it describes changes. Whereas the state-of-the-art approaches are guided by the same basic intuitions and aspirations as belief updates in the context of classical logic, they build upon fundamentally different principles and methods, which have prevented a unifying framework that could embrace both belief and rule updates. In this paper, we will overview some of the main approaches and results related to answer-set programming updates, while pointing out some of the main challenges that research in this topic has faced.publishersversionpublishe

Belief revision in the propositional closure of a qualitative algebra

Belief revision is an operation that aims at modifying old be-liefs so that they become consistent with new ones. The issue of belief revision has been studied in various formalisms, in particular, in qualitative algebras (QAs) in which the result is a disjunction of belief bases that is not necessarily repre-sentable in a QA. This motivates the study of belief revision in formalisms extending QAs, namely, their propositional clo-sures: in such a closure, the result of belief revision belongs to the formalism. Moreover, this makes it possible to define a contraction operator thanks to the Harper identity. Belief revision in the propositional closure of QAs is studied, an al-gorithm for a family of revision operators is designed, and an open-source implementation is made freely available on the web