The origins of treating agency as a modal concept go back at least to the 11th century when Anselm, Archbishop of Canterbury, provided a modal explication of the Latin facere ‘to do’, which can be formalized within the context of modern modal logic and neighborhood semantics. The agentive logic induced by his conception satisfies the traditional square of opposition, but also has some unique pr...

conclusions the results have shown a significant negative correlation between secure style and marital dissatisfaction. there were positive significant relationships between marital dissatisfaction and variables of insecure style, ambivalent style, difficulty in identifying emotions, and externally oriented thinking, but there was not any significant relationship between marital dissatisfaction...

during the past several decades, neighborhoods have experienced gentrification phenomenon in a number of cities. gentrification, the process of neighborhood change that results in the replacement of lower income residents with higher income ones, has altered the character of hundreds of urban neighborhoods in many north american and european cities. in this paper we state how does gentrificatio...

In this paper a variable neighborhood search approach as a method for solving combinatory optimization problems is presented. A variable neighborhood search based algorithm for solving the problem concerning the university course timetable design has been developed. This algorithm is used to solve the real problem regarding the university course timetable design. It is compared with other algor...

Modal logics for reasoning about the power of coalitions capture the notion of effectivity functions associated with game forms. The main goal of coalition logics is to provide formal tools for modeling the dynamics of a game frame whose states may correspond to different game forms. The two classes of effectivity functions studied are the families of playable and truly playable effectivity fun...

We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}ψ]φ expressing that the coalition of all agents satisfying ψ(x) can achieve a state in which φ holds. We use neighborhood semantics to model extensive games of perfect information with simultaneous actions and we provide a framework reasoning about agents in the same way as it is rea...

In this paper, for a complete residuated lattice L, we present the categorical properties of ?-neighborhood spaces and their relationships to neighborhood stratified L-neighborhood spaces. The main results are: (1) category is topological category; (2) can be embedded in as reflective subcategory, when L meet-continuous lattice, subcategory; (3) continuous (resp., spaces) simultaneously corefle...

A considerable amount of recent research has been conducted on the link-prediction problem, that is the problem of accurately predicting edges that will be established between actors of a social network in a future time period [LNK07, LZ10]. In cooperation with the provider of a German social network site (SNS), we aim to contribute to this line of research by analyzing the link-formation and i...

We apply a physical based model to describe the clothes fashion market. Every time a new outlet appears on the market, it can invade the market under certain specific conditions. Hence, the “old” outlet can be completely dominated and disappears. Each creator competes for a finite population of agents. Fashion phenomena are shown to result from a collective phenomenon produced by local individu...

Given an undirected weighted graph G = (V,E) with vertex set V, edge set E and weights wi ∈ R associated to V or to E. Minimum weighted k-Cardinality tree problem (k-CARD for short) consists of finding a subtree of G with exactly k edges whose sum of weights is minimum [4]. There are two versions of this problem: vertex-weighted and edge-weighted, if weights to V or to E are associated, respect...