
Lesage, Cédric; Cottrell, Marie
Since the beginning of the 1980's, a lot of news approaches of biomimetic inspiration have been defined and developed for imitating the brain behavior, for modeling non linear phenomenon, for providing new hardware architectures, for solving hard problems. They are named Neural Networks, Multilayer Perceptrons, Genetic algorithms, Cellular Automates, SelfOrganizing maps, Fuzzy Logic, etc. They can be summarized by the word of Connectionism, and consist of an interdisciplinary domain between neuroscience, cognitive science and engineering. First they were applied in computer sciences, engineering, biological models, pattern recognition, motor control, learning algorithms, etc. But rapidly, it appeared that these methods could...

Mundhenk, Martin; Weiss, Felix
We investigate the complexity of the model checking problem for propositional intuitionistic logic. We show that the model checking problem for intuitionistic logic with one variable is complete for logspaceuniform AC^1, and for intuitionistic logic with two variables it is Pcomplete. For superintuitionistic logics with one variable, we obtain NC^1completeness for the model checking problem and for the tautology problem.

Blühdorn, Ingolfur; Butzlaff, Felix
Despite the burgeoning literature on rightwing populism, there is still considerable uncertainty about its causes, its impact on liberal democracies and about promising counterstrategies. Inspired by recent suggestions that (1) the emancipatory left has made a significant contribution to the proliferation of the populist right; and (2) populist movements, rather than challenging the established sociopolitical order, in fact stabilize and further entrench its logic, this article argues that an adequate understanding of the populist phenomenon necessitates a radical shift of perspective: beyond the democratic and emancipatory norms, which still govern most of the relevant literature. Approaching its subject matter via...

Chohra, A.; Bahrammirzaee, A.; Kanzari, D.; Madani, K.
International audience

Chohra, A.; Bahrammirzaee, A.; Kanzari, D.; Madani, K.
International audience

NASSER, Yehya; PREVOTET, JeanChristophe; Hélard, Maryline
Nowadays energy consumption is a major criterion in any electronic system, especially when it comes to systems working at high throughput with restricted energy consumption constraints like in the Internet of things (IoT), wireless sensor networks, etc. In a near future, these devices will connect billions of services with different computing intensive applications including smart homes, wearable devices, healthcare and smart cities. For these devices, the major source of power will be a either a battery or an energy harvesting system. In this context, new design constraints are going to appear and will definitely require to take power consumption into...

Blanqui, Frédéric
We provide a general and modular criterion for the termination of simplytyped λ calculus extended with function symbols defined by userdefined rewrite rules. Following a work of Hughes, Pareto and Sabry for functions defined with a fixpoint operator and patternmatching, several criteria use typing rules for bounding the height of arguments in function calls. In this paper, we extend this approach to rewritingbased function definitions and more general userdefined notions of size.

Christopher, Leturc; Bonnet, Grégory
International audience

He, Zhenxue; Qin, Guangjun; Xiao, Limin; Gu, Fei; Huo, Zhisheng; Ruan, Li; Wang, Haitao; Zhang, Longbing; Liu, Jianbin; Liu, Shaobo; Wang, Xiang
International audience

Loeding, Christof; Serre, Olivier
International audience

Blanqui, Frédéric; Riba, Colin
http://dx.doi.org/10.1007/11916277_8

Blanqui, Frédéric
International audience

Blanqui, Frédéric; CoupetGrimal, Solange; Delobel, William; Hinderer, Sébastien; Koprowski, Adam
International audience

Blanqui, Frédéric
Full version

Blanqui, Frédéric
A protocolindependent secrecy theorem is established and applied to several nontrivial protocols. In particular, it is applied to protocols proposed for protecting the computation results of freeroaming mobile agents doing comparison shopping. All the results presented here have been formally proved in Isabelle by building on Larry Paulson's inductive approach. This therefore provides a library of general theorems that can be applied to other protocols.

Blanqui, Frédéric
International audience

Blanqui, Frédéric
International audience

Loeding, Christof; Lutz, Carsten; Serre, Olivier
International audience

Blumensath, Achim; Colcombet, Thomas; Löding, Christof
We survey operations on (possibly infinite) relational structures that are compatible with logical theories in the sense that, if we apply the operation to given structures then we can compute the theory of the resulting structure from the theories of the arguments (the logics under consideration for the result and the arguments might differ). Besides general compatibility results for these operations we also present several results on restricted classes of structures, and their use for obtaining classes of infinite structures with decidable theories.

Fischer, Diana; Grädel, Erich; Kaiser, Lukasz
International audience