Social impacts in social media: An examination of perceived truthfulness and sharing of information

Twitter, Facebook, and other social media display the combined opinion of users as collective opinion. The purpose of the work reported here was to examine how collective opinion might influence the perceived truthfulness and the sharing likelihood of health-related statements on social media. Experiment 1 revealed that, when evaluating the truthfulness of a statement, participants adopted the collective truthfulness rating associated with the statement. Similarly, Experiment 2 showed that the likelihood that participants would share a statement followed the collective sharing likelihood associated with the statement. These social impacts were extensive, taking place for statements perceived as true, debatable, and false. These results contribute new insights into how people perceive and share information on social media as well as how collective opinion might affect the quality of information on social media.     

Reasoning about fuzzy temporal information from the web: towards retrieval of historical events

When searching for information about historical events, queries are naturally formulated using temporal constraints. However, the structured temporal information needed to support such constraints is usually not available to information retrieval systems. Furthermore, the temporal boundaries of most historical events are inherently ill-defined, calling for suitable extensions of classical temporal reasoning frameworks. In this paper, we propose a framework based on a fuzzification of Allen’s Interval Algebra to cope with these issues. By using simple heuristic techniques to extract temporal information from web documents, we initially focus more on recall than on precision, relying on the subsequent application of a fuzzy temporal reasoner to improve the reliability of the extracted information, and to deal with conflicts that arise because of the vagueness of events. Experimental results indicate that a consistent and reliable knowledge base of fuzzy temporal relations can thus be obtained, which effectively allows us to target temporally constrained retrieval tasks.     

Reasoning about programs

This paper describes a theorem prover that embodies knowledge about programming constructs, such as numbers, arrays, lists, and expressions. The program can reason about these concepts and is used as part of a program verification system that uses the Floyd-Naur explication of program semantics. It is implemented in the qa4 language; the qa4 system allows many pieces of strategic knowledge, each expressed as a small program, to be coordinated so that a program stands forward when it is relevant to the problem at hand. The language allows clear, concise representation of this sort of knowledge. The qa4 system also has special facilities for dealing with commutative functions, ordering relations, and equivalence relations; these features are heavily used in this deductive system. The program interrogates the user and asks his advice in the course of a proof. Verifications have been found for Hoare's FIND program, a real-number division algorithm, and some sort programs, as well as for many simpler algorithms. Additional theorems have been proved about a pattern matcher and a version of Robinson's unification algorithm. The appendix contains a complete, annotated listing of the deductive system and annotated traces of several of the deductions performed by the system.     

Thinking about Reasoning about Knowledge

Minds and Machines -     

Reasoning about equality

This note contains a set of six theorems that can be used to assess the ability of a theorem-proving system to reason about equality. The six theorems are graduated in terms of difficulty: they range from fairly trivial to quite difficult. They do not cover all aspects of equality reasoning, but they have proved useful to us in developing our system.This work was supported in part by National Science Foundation grant MCS82-07496 and in part by the Applied Mathematical Sciences Research Program (KC-04-02) of the Office of Energy Research of the U.S. Department of Energy under Contract W-31-109-Eng-38.     

Reasoning about memory layouts

Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split-heap memory model, but also programs that access through pointers arbitrary memory objects such as local variables, single struct fields, or array slices. We present a logic for memory layouts that covers these applications and show how proof obligations arising during the verification can be discharged automatically using the layouts. The framework developed in this way is also suitable for reasoning about data structures manipulated by algorithms, which we demonstrate by verifying the Schorr-Waite graph marking algorithm.     

Reasoning about interactive system

Interactive systems have goals and characteristics that differ from those of batch systems. These differences lead to a need for new techniques, methods, and tools for manipulating and constructing interactive systems. The difference in structure between batch and interactive systems. The difference is considered, focusing on the distinction between command decomposition and component decomposition. The possible ways of solving a problem using an interactive system using action paths, which account for the relatively unconstrained actions of interactive users, are described. It is shown that interactivity is not an inherent characteristic of a system but rather a characteristic that depends on the error profile of its users. The requirements that interaction places on the underlying implementation, specifically the need for incrementality and integration, are considered. The results are applied to several existing classes of systems     

Reasoning about agent deliberation

We present a family of sound and complete logics for reasoning about deliberation strategies for SimpleAPL programs. SimpleAPL is a fragment of the agent programming language 3APL designed for the implementation of cognitive agents with beliefs, goals and plans. The logics are variants of PDL, and allow us to prove safety and liveness properties of SimpleAPL agent programs under different deliberation strategies. We show how to axiomatise different deliberation strategies for SimpleAPL programs, and, for each strategy we prove a correspondence between the operational semantics of SimpleAPL and the models of the corresponding logic. We illustrate the utility of our approach with an example in which we show how to verify correctness properties for a simple agent program under different deliberation strategies.     

Reasoning about coalitional games

We develop, investigate, and compare two logic-based knowledge representation formalisms for reasoning about coalitional games. The main constructs of Coalitional Game Logic (cgl) are expressions for representing the ability of coalitions, which may be combined with expressions for representing the preferences that agents have over outcomes. Modal Coalitional Game Logic (mcgl) is a normal modal logic, in which the main construct is a modality for expressing the preferences of groups of agents. For both frameworks, we give complete axiomatisations, and show how they can be used to characterise solution concepts for coalitional games. We show that, while cgl is more expressive than mcgl, the former can only be used to reason about coalitional games with finitely many outcomes, while mcgl can be used to reason also about games with infinitely many outcomes, and is in addition more succinct. We characterise the computational complexity of satisfiability for cgl, and give a tableaux-based decision procedure.     

Reasoning about emotional agents

In this article we discuss the role of emotions in artificial agent design, and the use of logic in reasoning about the emotional or affective states an agent can reside in. We do so by extending the KARO framework for reasoning about rational agents appropriately. In particular, we formalize in this framework how emotions are related to the action monitoring capabilities of an agent. © 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 601–619, 2006.     

Reasoning about Information Change

In this paper we introduce Dynamic Epistemic Logic, which is alogic for reasoning about information change in a multi-agent system. Theinformation structures we use are based on non-well-founded sets, and canbe conceived as bisimulation classes of Kripke models. On these structures,we define a notion of information change that is inspired by UpdateSemantics (Veltman, 1996). We give a sound and complete axiomatization ofthe resulting logic, and we discuss applications to the puzzle of the dirtychildren, and to knowledge programs.     

Reasoning algebraically about loops

We show how to formalise different kinds of loop constructs within the refinement calculus, and how to use this formalisation to derive general transformation rules for loop constructs. The emphasis is on using algebraic methods for reasoning about equivalence and refinement of loop constructs, rather than operational ways of reasoning about loops in terms of their execution sequences. We apply the algebraic reasoning techniques to derive a collection of transformation rules for action systems and for guarded loops. These include transformation rules that have been found important in practical program derivations: data refinement and atomicity refinement of action systems; and merging, reordering, and data refinement of loops with stuttering transitions. Received: 11 February 1998 / 18 March 1999     

The relationship between motivation and information sharing about products and services on Facebook

The purpose of this research is to explain the information-sharing process and investigate the intrinsic and extrinsic motivations that may induce information sharing on Facebook. Using the theory of planned behaviour, this research distinguishes between information-sharing intention and information-sharing behaviour. Based on self-determination theory, this research selects the extrinsic and intrinsic motivations that influence intention. Based on a survey of 233 South Korean Facebook users in their 20s and 30s, this research applies a structural equation modelling approach to develop the research model. All the intrinsic motivations are found to have a significant positive influence on information sharing about products and services. However, among the extrinsic motivations, only expected reciprocal relationship is found to have a significant positive influence on information-sharing intention. This research approaches Facebook empirically from a marketing perspective and suggests a strategic direction for marketers and Facebook managers.     

Enabling information sharing within organizations

Organizations which have invested heavily in Enterprise Resource Planning (ERP) systems, intranets and Enterprise Information Portals (EIP) with standardized workflows, data definitions and a common data repository, have provided the technlogical capability to their workgroups to share information at the enterprise level. However, the responsibility of populating the repository with relevant and high quality data required for customized data analyses is spread across workgroups associated with specific business processes. In an information interdependent setting, factors such as short-term organizational focus and the lack of uniformity in information management skills across workgroups can act as impediments to information sharing. Using an analytical model of information exchange between two workgroups, we study the impact of measures (e.g., creating a perception of continuity and persistence in interactions, benefit sharing, etc.) on the performance of the workgroups and the organization. The model considers a setting we describe as information complementarity, where the payoff to a workgroup depends not only on the quality of its own information, but also on that of the information provided by other workgroups. We show how a long-term vision combined with homogeneity in information management capabilities across workgroups can lead to organizationally desirable levels of information exchange, and how benefit sharing can either help or hurt individual and organizational information exchange outcomes under different circumstances. Our analysis highlights the need for appropriate organizational enablers to realize the benefits of enterprise systems and related applications.

一种信息共享的主动服务框架

信息共享服务是Internet核心功能之一。提出了一种基于Internet与下一代广播网相互融合的信息共享主动服务框架,探讨了网络层次模型、业务流生成及内容解析等核心技术。该系统立足于Internet信息资源,通过对信息合理的收集、组织与分发,结合统一内容定位和信息过滤技术,实现个性化、主动化的信息服务。最后讨论了基于Web服务的信息订阅/发布主动服务系统的实现模型与实现框架。