نتایج جستجو برای: λ logic algorithm

تعداد نتایج: 902091  

Mohammad Reza Meybodi Mojtaba Gholamian,

So far various methods for optimization presented and one of most popular of them are optimization algorithms based on swarm intelligence and also one of most successful of them is Particle Swarm Optimization (PSO). Prior some efforts by applying fuzzy logic for improving defects of PSO such as trapping in local optimums and early convergence has been done. Moreover to overcome the problem of i...

2012
Alberto Carraro

The stack calculus is a functional language in which is in a Curry-Howard correspondence with classical logic. It enjoys confluence but, as well as Parigot's λ µ, does not admit the Böhm Theorem, typical of the λ-calculus. We present a simple extension of stack calculus which is for the stack calculus what Saurin's Λµ is for λ µ.

Journal: :J. Symb. Log. 2003
George Goguadze Carla Piazza Yde Venema

We define an interpretation of modal languages with polyadic operators in modal languages that use monadic operators (diamonds) only. We also define a simulation operator which associates a logic Λ in the diamond language with each logic Λ in the language with polyadic modal connectives. We prove that this simulation operator transfers several useful properties of modal logics, such as finite/r...

Journal: :Robotics and Autonomous Systems 2011
Sameh F. Desouky Howard M. Schwartz

This paper addresses the problem of tuning the input and the output parameters of a fuzzy logic controller. The system learns autonomously without supervision or a priori training data. Two novel techniques are proposed. The first technique combines Q(λ)-learning with function approximation (fuzzy inference system) to tune the parameters of a fuzzy logic controller operating in continuous state...

2007
Marco Gaboardi Simona Ronchi Della Rocca

Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted rules for exponentials, which is correct and complete for PTIME. We design a type assignment system for the λ-calculus (STA), which assigns to λ-terms as types (a proper subset of) SLL formulas, in such a way that typable terms inherit the good complexity properties of the logical system. Namely STA enjoys subje...

Journal: :Remote Sensing 2022

In situ hyperspectral remote-sensing reflectance (Rrs(λ)) is used to derive water quality products and perform autonomous monitoring of aquatic ecosystems. Conventionally, above-water Rrs(λ) estimated from three spectroradiometers which measure downwelling planar irradiance (Ed(λ)), sky radiance (Ls(λ)), total upwelling (Lt(λ)), with a scaling Ls(λ)/Ed(λ) correct for surface-reflected radiance....

2004
Lutz Schröder

We investigate the logical aspects of the partial λ-calculus with equality, exploiting an equivalence between partial λ-theories and partial cartesian closed categories (pcccs) established here. The partial λ-calculus with equality provides a full-blown intuitionistic higher order logic, which in a precise sense turns out to be almost the logic of toposes, the distinctive feature of the latter ...

2016
Ugo Dal Lago

We introduce a linear infinitary λ-calculus, called `Λ∞, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted coinductively. The obtained calculus embeds the infinitary applicative λ-calculus and is universal for computations over infinite strings. What is particularly interesting about `Λ∞, is that the re...

1992
Philippe de Groote

This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (λ-LK→) whose inhabited types are exactly the implicative tautologies of classical logic and whose type assignment system is a classical sequent calculus. Intuitively, the terms of λ-LK→ correspond to constructs that are highly non-deterministic....

1994
Torben Braüner

This paper extends Curry-Howard interpretations of Intuitionistic Logic (IL) and Intuitionistic Linear Logic (ILL) with rules for recursion. The resulting term languages, the λ-calculus and the linear λ-calculus respectively, are given sound categorical interpretations. The embedding of proofs of IL into proofs of ILL given by the Girard Translation is extended with the rules for recursion, suc...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید