This paper introduces two variants of the Event Calculus (EC) with relative timing of events: the Credulous and the Skeptical Event Calculus (CREC and SKEC respectively). A model that takes into account the dynamics of event ordering updates is constructed for EC. In this model, that appears to be a restriction of the usual model for the modal logic S4, CREC and SKEC are proved to be the modal ...

We study the extent to which online social networks can be connected to knowledge bases. The problem is referred to as learning social knowledge graphs. We propose a multi-modal Bayesian embedding model, GenVector, to learn latent topics that generate word embeddings and network embeddings simultaneously. GenVector leverages large-scale unlabeled data with embeddings and represents data of two ...

The objective of this paper is to provide the theoretical background and illustrative examples for elastic buckling analysis of cold-formed steel members with general boundary conditions as implemented in the forthcoming update to CUFSM. CUFSM is an open source finite strip elastic stability analysis program freely distributed by the senior author. Although the finite strip method presents a ge...

From the perspective of the minimal majority logic proposed by Pauly [12], we investigate the relation between axiomatic social choice theory, the logic of simple games, and neighbourhood semantics. We discuss the importance of the Rudin-Keisler ordering in this context and provide a simple characterisation of the monotonic modal fragment that corresponds to the logic of simple games based on t...

“Counterfactual” readings of might/could have were previously analyzed using metaphysical modal bases. This paper presents examples and scenarios where the assumptions of such a branching-time semantics are not met, because there are facts at the base world and time which exclude the complement of the modal being true or becoming true. Additional arguments show that counterfactual readings are ...

We investigate parameter synthesis in the context of temporalepistemic logic. We introduce CTLPK, a parametric extension to the branching time temporal-epistemic logic CTLK with free variables representing groups of agents. We give algorithms for automatically synthesising the groups of agents that make a given parametric formula satisfied. We discuss an implementation of the technique on top o...

In many logics dealing with information one needs to make statements not only about cognitive states, but also about transitions between them. In this paper we analyze a dynamic modal logic that has been designed with this purpose in mind. On top of an abstract information ordering on states it has instructions to move forward or backward along this ordering, to states where a certain assertion...

In an earlier work we showed how a competitive satisfiability solver for the modal logicK can be built on top of a BDD package. In this work we study optimization issues for such solvers. We focus on two types of optimizations. First we study variable ordering, which is known to be of critical importance to BDD-based algorithms. Second, we study modal extensions of the pure-literal rule. Our re...