Mostrando recursos 61 - 80 de 10.357

  1. Connectionist approaches in economics and management sciences

    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, Self-Organizing 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...

  2. The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete

    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 logspace-uniform AC^1, and for intuitionistic logic with two variables it is P-complete. For superintuitionistic logics with one variable, we obtain NC^1-completeness for the model checking problem and for the tautology problem.

  3. Rethinking Populism: Peak democracy, liquid identity and the performance of sovereignty

    Blühdorn, Ingolfur; Butzlaff, Felix
    Despite the burgeoning literature on right-wing populism, there is still considerable uncertainty about its causes, its impact on liberal democracies and about promising counter-strategies. 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 socio-political 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...

  4. Personality Aspects and Fuzzy Logic for Bilateral Negotiation Behaviors with Incomplete Information

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

  5. Personality Aspects and Fuzzy Logic for Bilateral Negotiation Behaviors with Incomplete Information

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

  6. Power Modeling for Fast Power Estimation on FPGA

    NASSER, Yehya; PREVOTET, Jean-Christophe; 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, health-care 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...

  7. Size-based termination of higher-order rewriting

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

  8. A normal modal logic for trust in the sincerity

    Christopher, Leturc; Bonnet, Grégory
    International audience

  9. An Efficient Polarity Optimization Approach for Fixed Polarity Reed-Muller Logic Circuits Based on Novel Binary Differential Evolution Algorithm

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

  10. Propositional Dynamic Logic with Recursive Programs

    Loeding, Christof; Serre, Olivier
    International audience

  11. Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems

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

  12. Higher-order dependency pairs

    Blanqui, Frédéric
    International audience

  13. CoLoR: a Coq library on rewriting and termination

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

  14. Decidability of Type-checking in the Calculus of Algebraic Constructions with Size Annotations

    Blanqui, Frédéric
    Full version

  15. An Isabelle formalization of protocol-independent secrecy with an application to e-commerce

    Blanqui, Frédéric
    A protocol-independent secrecy theorem is established and applied to several non-trivial protocols. In particular, it is applied to protocols proposed for protecting the computation results of free-roaming 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.

  16. Inductive types in the Calculus of Algebraic Constructions

    Blanqui, Frédéric
    International audience

  17. Rewriting modulo in Deduction modulo

    Blanqui, Frédéric
    International audience

  18. Propositional Dynamic Logic with Recursive Programs

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

  19. Logical Theories and Compatible Operations

    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.

  20. Model Checking Games for the Quantitative mu-Calculus

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

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.