Ranking blog posts that express opinions regarding a given topic should serve a critical function in helping users. We explored three types of opinion retrieval methods in the framework of probabilistic language models. The first method combines topic-relevance model and opinion-relevance model that captures topic dependence of the opinion expressions. The second method makes use of probability...

This paper analyses the arguments of a group of philosophers – Davidson [7, 6], Kim [9], Bennett [1] and Parsons [15] – who have worked on the semantics of actions. They argue that inference patterns involving adverbs require a semantics, formalised in first-order logic, in which actions are first-class individuals. In particular, equalities between actions must be meaningful. (We should note, ...

This paper discusses constraints on grammaticalization, a primarily diachronic process through which lexical elements take on grammatical functions. In particular, it will argue that two constraints on this process, namely Persistence and Layering, explain the different distributional patterns of time-relationship adverbs in Japanese, Korean, English and German. Furthermore, it will suggest tha...

Any scientific discovery must include an epistemic process to gain knowledge of or to ascertain the existence of some empirical and/or logical entailments previously unknown or unrecognized. This paper proposes a new programming paradigm, named Epistemic Programming, which regards entailments as the subject of computing, takes three primary epistemic operations, i.e., epistemic deduction of kno...

Abstract Old and Early Middle English did not yet have modal sentential adverbs of low probability. Norse such words, either. From the 13th century onwards first epistemic prepositional phrases Anglo-Norman origin functioning as adverbials consisting preposition per/par nouns adventure , case chance were borrowed into English. In late 15th an analogous hybrid form per-hap(s) combination French ...

A commonly used dynamic epistemic logic is one obtained by adding common knowledge and public announcements to a basic epistemic logic. It is known from Kooi (2007) that adding public substitutions to such a logic adds expressivity over the class K of models. Here I show that substitutions also add expressivity over the classes KD45, S4 and S5 of models. Since the combination of common knowledg...

This paper studies the logical features of social group creation. We focus on the mechanisms which indicate when agents can form a team based on the correspondence in their set of features (behavior, opinions, etc.). Our basic approach uses a semi-metric on the set of agents, which is used to construct a network topology. Then it is extended with epistemic features to represent the agents’ epis...

Two currently active strands of research on logics for multi-agent systems are dynamic epistemic logic, focusing on the epistemic consequences of actions, and logics of coalitional ability, focusing on what coalitions of agents can achieve by cooperating strategically. In this paper we make a first attempt to bridge these topics by considering the question: “what can a coalition achieve by publ...

This paper provides a sound and complete proof system for a language Le+Y that adds to Dynamic Epistemic Logic (DEL) a discrete previous-time operator as well as single symbol formulas that partially reveal the most recent event that occured. The completeness theorem is by filtration followed by model unravelling and other model transformations. Decidability follows from the completeness proof....