This paper explores many important properties of negations using the neighborhood semantics. We generalize the correspondence between the properties of negations and the conditions on the frames and also establish the duality between distributive lattices with negation and descriptive general negation-neighborhood frames.

The Minimum Coloring Cut Problem is defined as follows: given a connected graph G with colored edges, find an edge cut E′ of G (a minimal set of edges whose removal renders the graph disconnected) such that the number of colors used by the edges in E′ is minimum. In this work, we present two approaches based on Variable Neighborhood Search to solve this problem. Our algorithms are able to find ...

Variable Neighborhood Search (VNS) is a metaheuristic for solving optimization problems based on a systematic change of neighborhoods. In recent years, a large variety of VNS strategies have been proposed. However, we have only found limited experimental comparisons among different VNS variants. This paper reviews three VNS strategies for finding near-optimal solutions for vertex-cut minimizati...

A. We present a generalization of Segerberg’s onion semantics for belief revision, in which the linearity of the spheres need not occur. The resulting logic is called broccoli logic. We provide a minimal relational logic, introducing a new neighborhood semantics operator. We then show that broccoli logic is a well-known conditional logic, the Burgess-Veltman minimal conditional logic.

A VNS-based heuristic using both a facility as well as a customer type neighbourhood structure is proposed to solve the p-centre problem in the continuous space. Simple but effective enhancements to the original Elzinga-Hearn algorithm as well as a powerful ‘locate-allocate’ local search used within VNS are proposed. In addition, efficient implementations in both neighbourhood structures are pr...

The stabilisation through regional and multilateral cooperation within the framework of the European Union is the topic today. These terms are all part of standard political discourse in South East Europe, often accompanied by description of abundant initiatives by various regional or multilateral organisations. What is more often lacking is an explicit idea about how these institutional initia...

A variable neighborhood search approach to the exploration of an online social network Vera Kovačević Vujčić, Mirjana Čangalović and Jozef Kratica Using VNS for the optimal synthesis of the communication tree in wireless sensor networks Adil Erzin, Roman V. Plotnikov

In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of communication resources, and for each model we identify schemes that achieve successful diffusion of information at optimal rates. For edge-capacitated networks, we show optimality of the so-called “random-useful” pack...

Two of the authors (van Benthem and Pacuit) recently introduced evidence logic as a way to model epistemic agents faced with possibly contradictory evidence from different sources. For this the authors used neighborhood semantics, where a neighborhood N indicates that the agent has reason to believe that the true state of the world lies in N . A normal belief modality is defined in terms of the...

We deepen the study of two known neighborhood structures, which here will be called f · k-neighborhood structures and f · q-neighborhood structures, in the context of Šostak fuzzy topological spaces. In particular, we characterize fuzzy topologies by f · k-neighborhood structures. Moreover we introduce and discuss the notions of f · kneighborhood prestructure and f ·m-neighborhood structure in ...