This paper presents a representation for natural language plurals in knowledge base queries, implementing collective, distributive, cumulative, and multiply distributive senses of the plural by means of higher predicates. The underlying semantics is based on Franconi’s theory of collections. The collective reading of a plural applies the predicate to the whole collection; the distributive readi...

P systems is a new model of computation, inspired by natural processes, that has a distributive nature. By exploring this distributive nature of P systems, we have built a purely distributive simulation of P systems. The simulation, whose implementation is described here, was programmed in the Java programming language and makes heavy use of its Remote Method Invocation protocol. The class of P...

We establish a topological duality for bounded lattices. The two main features of our duality are that it generalizes Stone duality for bounded distributive lattices, and that the morphisms on either side are not the standard ones. A positive consequence of the choice of morphisms is that those on the topological side are functional. Towards obtaining the topological duality, we develop a unive...

the aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. all values aretaken in a fixed frame $l$. a definition of (strongly) completelydistributive $l$-ordered sets is introduced. the main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $l$-ordereds...

In this paper, we extend some results obtained by A. Amroune and B. Davvaz in [1]. More precisely, we will develop a representation theory of intuitionistic fuzzy perfect distributive lattices in the finite case. To that end, we introduce the notion of intuitionistic fuzzy perfect distributive lattices and the one of fuzzy perfect Priestley spaces. In this way, the results of A. Amroune and B. ...

Duality theory emerged from the work by Marshall Stone [18] on Boolean algebras and distributive lattices in the 1930s. Later in the early 1970s Larisa Maksimova [10, 11] and Hilary Priestley [15, 16] developed analogous results for Heyting algebras, topological Boolean algebras, and distributive lattices. Duality for bounded, not necessarily distributive lattices, was developed by Alstir Urquh...

Distributed Constraint Optimization Problems (DCOPs) are a general framework that can model a large class of Multi-agent Coordination Problems (MCPs). We propose a novel message-passing algorithm, the so-called Action-GDL, as an extension to the Generalized Distributive Law algorithm to efficiently solve MCPs. We show the generality of Action-GDL by proving that it has DPOP, the low-complexity,...