Sunday, October 26, 2014



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía

rss_1.0 Clasificación por Disciplina

Nomenclatura Unesco > (11) Lógica

Mostrando recursos 101 - 120 de 131,932

101. Primitive recursion in finiteness spaces - Lionel Vaux
We study iteration and recursion operators in the multiset relational model of linear logic and prove them finitary in the sense of the finiteness spaces recently introduced by Ehrhard. This provides a denotational semantics of Gödel's system T and paves the way for a systematic study of a large class of algorithms, following the ideas of Girard's quantitative semantics in a standard algebraic setting.

102. Reducing dynamic epistemic logic to PDL by program transformation - Jan van Eijck
We present a direct reduction of dynamic epistemic logic in the spirit of [4] to propositional dynamic logic (PDL) [17, 18] by program transformation. The program transformation approach associates with every update action a transformation on PDL programs. These transformations are then employed in reduction axioms for the update actions. It follows that the logic of public announcement, the logic of group announcements, the logic of secret message passing, and so on, can all be viewed as subsystems of PDL. Moreover, the program transformation approach can be used to generate the appropriate reduction axioms for these logics. Our direct reduction...

103. DEMO -- A Demo of Epistemic Modelling - Jan van Eijck
This paper introduces and documents DEMO, a Dynamic Epistemic Modelling tool. DEMO allows modelling epistemic updates, graphical display of update results, graphical display of action models, formula evaluation in epistemic models, translation of dynamic epistemic formulas to PDL formulas. Also, DEMO implements the reduction of dynamic epistemic logic to PDL. The paper is an exemplar of tool building for epistemic update logic. It contains the essential code of an implementation of DEMO in Haskell, in Knuth’s ‘literate programming’ style.

104. Modelling Epistemic Updates with Functional Programming - Jan van Eijck; Simona Orzan
Epistemic logic is the logic of knowledge, and dynamic epistemic logic is the logic of effects of communicative actions on the knowledge states of a set of agents. Typical communicative actions are making public announcements, passing private messages, revealing secrets, telling lies. This paper takes its starting point from the version of dynamic epistemic logic of [3], and demonstrates a tool that can be used for showing what goes on during a series of epistemic updates: the dynamic epistemic modelling tool DEMO [10]. DEMO allows modelling epistemic updates, graphical display of update results, graphical display of action models, formula evaluation...

105. Quantifier elimination by lazy model enumeration - David Monniaux
We propose a quantifier elimination scheme based on nested lazy model enumeration through SMT-solving, and projections. This scheme may be applied to any logic that fulfills certain conditions; we illustrate it for linear real arithmetic. The quantifier elimination problem for linear real arithmetic is doubly exponential in the worst case, and so is our method. We have implemented it and benchmarked it against other methods from the literature.

106. Differential linear logic and polarization - Lionel Vaux
We extend Ehrhard Regnier's differential linear logic along the lines of Laurent's polarization. We provide a denotational semantics of this new system in the well-known relational model of linear logic, extending canonically the semantics of both differential and polarized linear logics: this justifies our choice of cut elimination rules. Then we show this polarized differential linear logic refines the recently introduced convolution ¯λµ-calculus, the same as linear logic decomposes λ-calculus.

107. Primitive recursion in finiteness spaces - Lionel Vaux
We study iteration and recursion operators in the multiset relational model of linear logic and prove them finitary in the sense of the finiteness spaces recently introduced by Ehrhard. This provides a denotational semantics of Gödel's system T and paves the way for a systematic study of a large class of algorithms, following the ideas of Girard's quantitative semantics in a standard algebraic setting.

108. CODEWEAVE: Exploring Fine-Grained Mobility of Code - Cecilia Mascolo; Gian Pietro Picco; Gruia-Catalin Roman
This paper explores the range of constructs and issues facing the designer of mobile code systems which allow for the unit of mobility to be finer-grained than that of execution. Mobile Unity, a notation and proof logic for mobile computing, provides for this research a clean abstract setting, i.e., unconstrained by compilation and performance considerations traditionally associated with programming language design. Within the context of Mobile Unity, we take the extreme view that every line of code and every variable declaration is potentially mobile, i.e., it may be duplicated and/or moved from one program context to another on the same...

109. Prolegomena to the Definition of Dynamic Predicate Logic with Local Assignments - Albert Visser
In this paper we subject the possible ways to de ne versions of DPL with local assignments to a thorough and detailed scrutiny. We hope that our treatment is suggestive of the proper `abstract' view of dynamic logics that we would like to arrive at eventually.

110. Logics of Communication and Change - Johan van Benthem; Jan van Eijck; Barteld Kooi
Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that extend the epistemic base language with a new notion of ‘relativized common knowledge’, in such a way that the resulting full dynamic logic of information flow allows for a compositional analysis of all epistemic postconditions via perspicuous ‘reduction axioms’. We also show how such systems can deal with factual alteration, rather than just information change, making them cover a much...

111. Approximating Most Specific Concepts in Description Logics with Existential Restrictions - Ralf Küsters; Ralf Molitor
Computing the most specic concept (msc) is an inference task that allows to abstract from individuals defined in description logic (DL) knowledge bases. For DLs that allow for existential restrictions or number restrictions, however, the msc need not exist unless one allows for cyclic concepts interpreted with the greatest fixed-point semantics. Since such concepts cannot be handled by current DL-systems, we propose to approximate the msc. We show that for the DL ALE , which has concept conjunction, a restricted form of negation, existential restrictions, and value restrictions as constructors, approximations of the msc always exist and can effectively be...

112. Reasoning about abstract state machines: The WAM case study - Gerhard Schellhorn; Wolfgang Ahrendt
This paper describes the rst half of the formal verification of a Prolog compiler with the KIV ("Karlsruhe Interactive Verifier") system. Our work is based on [BR95], where an operational Prolog semantics is de ned using the formalism of Gurevich Abstract State Machines, and then refined in several steps to the Warren Abstract Machine (WAM). We define a general translation of sequential Abstract State Machines to Dynamic Logic, which formalizes correctness of such refinement steps as a deduction problem. A proof technique for verification is presented, which corresponds to the informal use of proof maps. 6 of the 12 given...

113. Lógicas de reprodução social, trajetórias produtivas e gestão do meio natural de agricultores familiares no sudoeste do Pará, Brasil - Rocha, Carla Giovana Souza; Almeida, Jalcione Pereira de
A partir de um conjunto de imagens foi O objetivo é identifi car e analisar as lógicas de reprodução social em sua relação com as práticas de gestão do meio natural, para refl etir sobre as possibilidades de mudanças socioprodutivas que favoreçam a diminuição do desmatamento na região da Rodovia Transamazônica, estado do Pará. Tem-se como aporte teórico-analítico a abordagem sobre reprodução social sugerida por Claude Raynaut, assim como as noções de experiência social e lógicas de ação de François Dubet. Apesar da relevância recente dada à questão ambiental, verifi case que as mudanças socioprodutivas locais têm relação direta com...

114. EU enlargement to the Balkans: will the leopard change its spots? EPC Commentary, 29 September 2014 - Stratulat, Corina
As the leadership of the European Union hands over the baton to a new management this autumn, will the winds of change blow also through the cobwebs of the EU’s enlargement agenda? Jean-Claude Juncker – the incoming President of the European Commission – has already promised to put the gearbox of further EU widening in neutral for the next five years of his mandate, and has designated the Austrian Johannes Hahn as Commissioner for the re-baptised portfolio of now European Neighbourhood Policy and Enlargement Negotiations, instructing him to focus on the Union’s political and economic ties with Southern and Eastern Europe,...

115. Customer Dominant Value Creation: A theoretical response to a recent call for a consumer dominant logic for marketing - Moutinho, Luiz; Anker, Thomas; Sparks, Leigh; Gronoos, Christian
No abstract available.

116. Verifying Functional Behaviour of Concurrent Programs - Zaharieva-Stojanovski, Marina; Huisman, Marieke; Blom, Stefan
Specifying the functional behaviour of a concurrent program can often be quite troublesome: it is hard to provide a stable method contract that can not be invalidated by other threads. In this paper we propose a novel modular technique for specifying and verifying behavioural properties in concurrent programs. Our approach uses history-based specifications. A history is a process algebra term built of actions, where each action represents an update over a heap location. Instead of describing the object's precise state, a method contract may describe the method's behaviour in terms of actions recorded in the history. The client class can...

117. A More Efficient AES Threshold Implementation - Bilgin, Begül; Gierlichs, Benekikt; Nikova, Svetla; Nikov, Ventzislav; Rijmen, Vincent
Threshold Implementations provide provable security against first-order power analysis attacks for hardware and software implementations. Like masking, the approach relies on secret sharing but it differs in the implementation of logic functions. At Eurocrypt 2011 Moradi et al. published the to date most compact Threshold Implementation of AES-128 encryption. Their work shows that the number of required random bits may be an additional evaluation criterion, next to area and speed. We present a new Threshold Implementation of AES-128 encryption that is 18% smaller, 7.5% faster and that requires 8% less random bits than the implementation from Eurocrypt 2011. In addition,...

118. El Real de Minas de Bolaños, Jalisco, en el siglo XVIII: transformaciones territoriales y cambios sociales - Ruiz Medrano, Carlos Rubén
En el presente artículo se muestra la forma en que la minería desarrollada en Bolaños durante el siglo xviii constituyó un poderoso incentivo para subordinar el territorio adyacente a nuevas lógicas comerciales, que lo transformaron y tuvieron efectos distintos en las comunidades indígenas situadas en las Fronteras de San Luis Colotlán, Jalisco. Un fenómeno multifactorial que ejerció presión directa sobre las identidades étnicas, al tiempo que desató conflictos sociales que se desplegaron en la región. Se considera que analizar la minería colonial bajo este esquema provee nuevos ángulos, más complejos para examinar la repercusión territorial de esta actividad.

119. Sistema computacional de integración del método de despliegue de la función de calidad y de la lógica difusa. - Vanegas Useche, Libardo V.; Ellis, Andrew; Labib, Ashraf W.
Este artículo presenta un programa computacional que integra el método de despliegue de la función de calidad con la teoría de conjuntos difusos. El programa permite estimar los niveles de impacto que las características de ingeniería de un producto pueden tener sobre la satisfacción del usuario. La teoría de conjuntos difusos se usa para tener en cuenta la incertidumbre de la información. Los grados de importancia de los atributos del usuario y las relaciones entre éstos y las características de ingeniería se representan mediante números difusos triangulares. Se utiliza el nuevo promedio difuso ponderado para evitar que la imprecisión de los resultados sea innecesariamente alta. Se presenta un ejemplo...

120. Política y política económica: reflexiones teóricas en torno del plan de ajuste 1984-1986 en Colombia - Carrasquilla, Alberto
En este artículo se intentan presentar algunos desarrollos conceptuales sobre la relación existente entre la credibilidad del público en las medidas de política económica adoptadas y el éxito de su aplicación. Para lograr este objetivo, se presenta un repaso histórico por la literatura relevante, donde se evalúan los conceptos de credibilidad y reputación con desarrollos lógicos asociados a las formulaciones sobre el papel y el manejo de la información. A continuación, y una vez se han establecido precisiones conceptuales sobre la presentación de la dinámica macroeconómica como representación del proceso político, se formula un modelo teórico que incluye tales precisiones...

Página de resultados:

Busque un recurso