An Avron rule for fragments of R-mingle

Axiomatic bases of admissible rules are obtained for fragments of the substructural logic R-mingle. In particular, it is shown that a ‘modus-ponens-like’ rule introduced by Arnon Avron forms a basis for the admissible rules of its implication and implication–fusion fragments, while a basis for the admissible rules of the full multiplicative fragment requires an additional countably infinite set of rules. Indeed, this latter case provides an example of a three-valued logic with a finitely axiomatizable consequence relation that has no finite basis for its admissible rules.

Preferred semantics as Socratic discussion

Funding For M.C., the major part of the work on this article was carried out while he was affiliated with the Interdisciplinary Centre for Security, Reliability and Trust at the University of Luxembourg. His research was supported by the National Research Fund, Luxembourg (LAAMI project), as well as by the Engineering and Physical Sciences Research Council (EPSRC, UK), grant ref. EP/J012084/1 (SAsSY project). For S.V., the major part of the work on this article was carried out while he was affiliated with the Computer Science and Communication Research Unit at the University of Luxembourg. He worked on this article during the tenure of an ERCIM Alain Bensoussan Fellowship Programme, which is supported by the Marie Curie Co-funding of Regional, National and International Programmes (COFUND) of the European Commission. During this time, he was also funded by the National Research Fund, Luxembourg. When finishing the work on this article, he was a CRNS researcher affiliated with CRIL

Preferred semantics as Socratic discussion

Funding For M.C., the major part of the work on this article was carried out while he was affiliated with the Interdisciplinary Centre for Security, Reliability and Trust at the University of Luxembourg. His research was supported by the National Research Fund, Luxembourg (LAAMI project), as well as by the Engineering and Physical Sciences Research Council (EPSRC, UK), grant ref. EP/J012084/1 (SAsSY project). For S.V., the major part of the work on this article was carried out while he was affiliated with the Computer Science and Communication Research Unit at the University of Luxembourg. He worked on this article during the tenure of an ERCIM Alain Bensoussan Fellowship Programme, which is supported by the Marie Curie Co-funding of Regional, National and International Programmes (COFUND) of the European Commission. During this time, he was also funded by the National Research Fund, Luxembourg. When finishing the work on this article, he was a CRNS researcher affiliated with CRIL

Multilingualism and conceptual modelling

One of the leading motivations behind the multilingual semantic web is to make resources accessible digitally in an online global multilingual context. Consequently, it is fundamental for knowledge bases to find a way to manage multilingualism and thus be equipped with those procedures for its conceptual modelling. In this context, the goal of this paper is to discuss how common-sense knowledge and cultural knowledge are modelled in a multilingual framework. More particularly, multilingualism and conceptual modelling are dealt with from the perspective of FunGramKB, a lexico-conceptual knowledge base for natural language understanding. This project argues for a clear division between the lexical and the conceptual dimensions of knowledge. Moreover, the conceptual layer is organized into three modules, which result from a strong commitment towards capturing semantic knowledge (Ontology), procedural knowledge (Cognicon) and episodic knowledge (Onomasticon). Cultural mismatches are discussed and formally represented at the three conceptual levels of FunGramKB.

Performatividad y arte computacional. Hacia una “DIY society”

El artículo analiza la figura del prosumidor desde los estudios visuales a partir de la combinación de la teoría de los actos de habla y los nuevos medios. El objetivo es evaluar si la distinción entre productores y consumidores, estrategias y tácticas de Michel de Certeau continúa siendo operativa en las interfaces gráficas de la cultura global de la información de Scott Lash. Para ello distingue dos tipos de performatividad de los actos de habla: la performatividad top-down del software, y la bottom-up de los juegos del lenguaje y las formas de vida. Estos tipos se aplican al análisis del discurso de los eslóganes que aparecen en los sitios web de las iniciativas “open” y de economía colaborativa, ya que las primeras están dedicadas a la producción de bienes inmateriales y las segundas a la producción de bienes materiales. El desarrollo muestra cómo los dos tipos de performatividad transforman el análisis textual de los estudios literarios y cinematográficos en una metodología capaz de investigar acciones materiales, humanas y no humanas. Las conclusiones describen el surgimiento de nuevas convenciones narrativas de poder y control ajenas a la ficción que apuntan a una “DIY society”.

The Definition and Implementation of a Computer Programming Language Based on Constraints

The constraint paradigm is a model of computation in which values are deduced whenever possible, under the limitation that deductions be local in a certain sense. One may visualize a constraint 'program' as a network of devices connected by wires. Data values may flow along the wires, and computation is performed by the devices. A device computes using only locally available information (with a few exceptions), and places newly derived values on other, locally attached wires. In this way computed values are propagated. An advantage of the constraint paradigm (not unique to it) is that a single relationship can be used in more than one direction. The connections to a device are not labelled as inputs and outputs; a device will compute with whatever values are available, and produce as many new values as it can. General theorem provers are capable of such behavior, but tend to suffer from combinatorial explosion; it is not usually useful to derive all the possible consequences of a set of hypotheses. The constraint paradigm places a certain kind of limitation on the deduction process. The limitations imposed by the constraint paradigm are not the only one possible. It is argued, however, that they are restrictive enough to forestall combinatorial explosion in many interesting computational situations, yet permissive enough to allow useful computations in practical situations. Moreover, the paradigm is intuitive: It is easy to visualize the computational effects of these particular limitations, and the paradigm is a natural way of expressing programs for certain applications, in particular relationships arising in computer-aided design. A number of implementations of constraint-based programming languages are presented. A progression of ever more powerful languages is described, complete implementations are presented and design difficulties and alternatives are discussed. The goal approached, though not quite reached, is a complete programming system which will implicitly support the constraint paradigm to the same extent that LISP, say, supports automatic storage management.

Metallosupramolecular Materials for Electronic Applications: Molecular Boolean Computation

It is an exciting era for molecular computation because molecular logic gates are being pushed in new directions. The use of sulfur rather than the commonplace nitrogen as the key receptor atom in metal ion sensors is one of these directions; plant cells coming within the jurisdiction of fluorescent molecular thermometers is another, combining photochromism with voltammetry for molecular electronics is yet another. Two-input logic gates benefit from old ideas such as rectifying bilayer electrodes, cyclodextrin-enhanced room-temperature phosphorescence, steric hindrance, the polymerase chain reaction, charge transfer absorption of donor–acceptor complexes and lectin–glycocluster interactions. Furthermore, the concept of photo-uncaging enables rational ways of concatenating logic gates. Computational concepts are also applied to potential cancer theranostics and to the selective monitoring of neurotransmitters in situ. Higher numbers of inputs are also accommodated with the concept of functional integration of gates, where complex input–output patterns are sought out and analysed. Molecular emulation of computational components such as demultiplexers and parity generators/checkers are achieved in related ways. Complexity of another order is tackled with molecular edge detection routines.

Non-Dominated Sorting Genetic Algorithm Based on Reinforcement Learning to Optimization of Broad-Band Reflector Antennas Satellite

This paper aims to provide an improved NSGA-II (Non-Dominated Sorting Genetic Algorithm-version II) which incorporates a parameter-free self-tuning approach by reinforcement learning technique, called Non-Dominated Sorting Genetic Algorithm Based on Reinforcement Learning (NSGA-RL). The proposed method is particularly compared with the classical NSGA-II when applied to a satellite coverage problem. Furthermore, not only the optimization results are compared with results obtained by other multiobjective optimization methods, but also guarantee the advantage of no time-spending and complex parameter tuning.

Leistungsverfügbarkeit und Echtzeitfähigkeit in Systemen intelligenter Ladungsträger

In diesem Artikel werden Leistungsverfügbarkeit und Echtzeitfähigkeit am Beispiel eines Lagersystems für intelligente Behälter betrachtet. Es wird dabei die Echtzeitfähigkeit dieses Systems anhand einer realistischen Fallstudie in einem Stetigfördersystem analysiert. Anhand dieser Analyse wird ein Konzept für die gezielte Planung eines Lagersystems für eine spezifische Leistungsverfügbarkeit entworfen. Kernbestandteil ist ein Kommunikationsprotokoll, das die Reservierung von Fördermitteln mittels logischer Zeit erlaubt. Über eine veränderte Reservierungsstrategie kann ein geeigneter Dispositionszeitpunkt berechnet werden, der eine Termineinhaltung aller Aufträge garantiert.

A molecular photoionic AND gate based on fluorescent signalling

MOLECULES that perform logic operations are prerequisites for molecular information processing and computation. We and others have previously reported receptor molecules that can be considered to perform simple logic operations by coupling ionic bonding or more complex molecular-recognition processes with photonic (fluorescence) signals: in these systems, chemical binding (the 'input') results in a change in fluorescence intensity (the 'output') from the receptor. Here we describe a receptor (molecule (1) in Fig. 1) that operates as a logic device with two input channels: the fluorescence signal depends on whether the molecule binds hydrogen ions, sodium ions or both. The input/output characteristics of this molecular device correspond to those of an AND gate.

Modification of Fluorescent Photoinduced Electron Transfer (PET) Sensors/Switches To Produce Molecular Photo-Ionic Triode Action

The fluorophore-spacer₁-receptor₁-spacer₂-receptor₂ system (where receptor₂ alone is photoredox-inactive) shows ionically tunable proton-induced fluorescence off-on switching, which is reminiscent of thermionic triode behavior. This also represents a new extension to modular switch systems based on photoinduced electron transfer (PET) towards the emulation of analogue electronic devices.

Fluorescent PET (Photoinduced Electron Transfer) Sensors with Targeting/Anchoring Modules as Molecular Versions of Submarine Periscopes for Mapping Membrane-Bounded Protons

The two families of fluorescent PET (photoinduced electron transfer) sensors (1-9) show that the effective proton density near the surface of several micelle membranes changes over 2-3 orders of magnitude as the microlocation of the sensor (with respect to the membrane) is altered via hydrophobic tuning.

Bile Acid Derived PET-Based Cation Sensors: Molecular Structure Dependence of their Sensitivity

A number of bile acid derived photoinduced electron transfer (PET) based sensors for metal ions are prepared. A general strategy for designing the sensor with a modular nature allows for making different molecules capable of sensing different metal ions by a change in the fluorophore and receptor unit. Keeping the basic molecular structure the same, different bile acid base fluoroionophores were prepared inorder to achieve the highest sensitivity toward the metal ions. Thesensors showed similar binding constants for the same metal ion, but the degree Of fluorescence enhancement upon addition of the metal salts were different. The sensitivities of the sensors towards a certain metal were determined from the observed fluorescence enhancement upon addition of the metal salt.