Sciweavers

265 search results - page 6 / 53
» Weakly Algebraizable Logics
Sort
View
JOLLI
2008
84views more  JOLLI 2008»
13 years 8 months ago
The basic constructive logic for a weak sense of consistency
In this paper, consistency is understood as the absence of the negation of a theorem, and not, in general, as the absence of any contradiction. We define the basic constructive log...
Gemma Robles, José M. Méndez
CCA
2009
Springer
14 years 3 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
LFCS
2009
Springer
14 years 3 months ago
Temporalization of Probabilistic Propositional Logic
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
Pedro Baltazar, Paulo Mateus
SGAI
2009
Springer
14 years 1 months ago
Improving Cooperative PSO using Fuzzy Logic
PSO is a population-based technique for optimization, which simulates the social behavior of the fish schooling or bird flocking. Two significant weaknesses of this method are: fir...
Zahra Afsahi, Mohammad Reza Meybodi
TYPES
2004
Springer
14 years 2 months ago
Extracting a Normalization Algorithm in Isabelle/HOL
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
Stefan Berghofer