Monday, August 3, 2015



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 161 - 180 de 146,115

161. Graded BDI models for agent architectures based on Lukasiewicz logic and propositional dynamic logic - Zhang, Xiaojun; Jiang, Min; Zhou, Changle; Hao, Yijiang; 张晓君; 江敏; 周昌乐
Conference Name:2012 International Conference on Web Information Systems and Mining, WISM 2012. Conference Address: Chengdu, China. Time:October 26, 2012 - October 28, 2012.

162. Modelo de computación conexionista inspirado en las redes de procesadores evolutivos y su aprendizaje - Díaz Martínez, Miguel Ángel
La informática teórica es una disciplina básica ya que la mayoría de los avances en informática se sustentan en un sólido resultado de esa materia. En los últimos a~nos debido tanto al incremento de la potencia de los ordenadores, como a la cercanía del límite físico en la miniaturización de los componentes electrónicos, resurge el interés por modelos formales de computación alternativos a la arquitectura clásica de von Neumann. Muchos de estos modelos se inspiran en la forma en la que la naturaleza resuelve eficientemente problemas muy complejos. La mayoría son computacionalmente completos e intrínsecamente paralelos. Por este motivo se les está llegando a considerar como nuevos...

163. Molecular Recognition of DNA by Small Molecules - Dervan, Peter B.
Chemists, like artists, are able to construct new three-dimensional objects, molecules and materials that exist only in the mind of a person. I became interested in creating novel molecular shapes with properties different from those found in nature shortly after arriving at Caltech in 1973. One cannot design without the brushes and paint of the craft. Indeed, modern organic chemists, standing on the shoulders of the pioneering achievements of Woodward, Corey, Merrifield, and others are able to apply the power of synthetic chemistry and the logic of incremental change to the field of structure–function. In early 1973, I was inspired...

164. Specification and Validation of Algorithms Generating Planar Lehman Words - Giorgetti, Alain; Senni, Valerio
International audience

165. Canonical forms for free κ-semigroups - Costa, José Carlos
Automata, Logic and Semantics

166. An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2 - Leroy, Julien
Automata, Logic and Semantics

167. Risk managmenet based on fuzzy logic for a Francis turbine - Tobon-Meja, Diego; Hennequin, Sophie; Rezg, Nidhal; Castaneda, Leonel
International audience

168. Learning stable weights for data of varying dimension - Beliakov, G.; James, S.; Gómez, D.; Rodríguez, Juan Tinguaro; Montero de Juan, Francisco Javier
In this paper we develop a data-driven weight learning method for weighted quasiarithmetic means where the observed data may vary in dimension.

169. Pseudofinite and Pseudocompact Metric Structures - Goldbring, Isaac; Lopes, Vinicius Cifú
The definition of a pseudofinite structure can be translated verbatim into continuous logic, but it also gives rise to a stronger notion and to two parallel concepts of pseudocompactness. Our purpose is to investigate the relationship between these four concepts and establish or refute each of them for several basic theories in continuous logic. Pseudofiniteness and pseudocompactness turn out to be equivalent for relational languages with constant symbols, and the four notions coincide with the standard pseudofiniteness in the case of classical structures, but the details appear to be slightly more important here than in the usual translation of definitions...

170. Substructural Fuzzy-Relevance Logic - Yang, Eunsuk
This paper proposes a new topic in substructural logic for use in research joining the fields of relevance and fuzzy logics. For this, we consider old and new relevance principles. We first introduce fuzzy systems satisfying an old relevance principle, that is, Dunn’s weak relevance principle. We present ways to obtain relevant companions of the weakening-free uninorm (based) systems introduced by Metcalfe and Montagna and fuzzy companions of the system R of relevant implication (without distributivity) and its neighbors. The algebraic structures corresponding to the systems are then defined, and completeness results are provided. We next consider fuzzy systems satisfying new...

171. Indiscernibles, EM-Types, and Ramsey Classes of Trees - Scow, Lynn
The author has previously shown that for a certain class of structures $\mathcal {I}$ , $\mathcal {I}$ -indexed indiscernible sets have the modeling property just in case the age of $\mathcal {I}$ is a Ramsey class. We expand this known class of structures from ordered structures in a finite relational language to ordered, locally finite structures which isolate quantifier-free types by way of quantifier-free formulas. This result is applied to give new proofs that certain classes of trees are Ramsey. To aid this project we develop the logic of EM-types.

172. Modelización y simulación dinámica de un automóvil deportivo de altas prestaciones - GARCÍA PÉREZ, ADRIÁN
Este Trabajo Fin de Grado consiste en la modelización del Porsche 911 Carrera S, uno de los modelos del mítico Porsche 911, que durante los años se ha fabricado siguiendo un estilo único que lo hace uno de los coches más emblemáticos de la historia del automovilismo. Durante el proyecto se ha llevado a cabo la modelización de todos los subsistemas que componen el vehículo a partir de los datos obtenidos y de las estimaciones que se consideraron oportunas al no disponer de toda la información necesaria. Todo esto se ha realizado utilizando una serie de programas informáticos auxiliares como Solidworks, Autodesk...

173. Logic for Automated Negotiation in E-Business - Cao, Mu-kun; Wang, Hong-li; 曹慕昆
Conference Name:International Colloquium on Computing, Communication, Control, and Management. Conference Address: Guangzhou, PEOPLES R CHINA. Time:AUG 04-05, 2008.

174. Construcciones encabezadas por la preposición entre: valores y restricciones sintácticas - Cabezas Holgado, Emilio
El presente trabajo trata los aspectos léxicos y sintácticos de la preposición entre y las construcciones que encabeza. Partiendo de las propiedades léxicas intrínsecas de dicha preposición pueden describirse las relaciones sintácticas que se establecen entre los SSPP que introduce y los argumentos a los que estas construcciones se orientan. Los valores locativo y colectivo, internos en la semántica de la preposición entre, permiten reflejar en la sintaxis la naturaleza predicativa de este tipo de sintagmas, pues constituyen expresiones de «posición en el interior de un conjunto». Tal expresión describe un modo en el que se dispone o presenta una...

175. Algorithm Validation in the Megha-Tropiques Framework: An Attempt to Improve the Microphysic Parameterization in a Radiative Transfer Model - Martini, Audrey; Viltard, Nicolas
In the framework of the Megha Tropiques Mission, we focus on the rain retrieval from MADRAS and other conical-scanning passive microwave imagers. The retrieval algorithm used here is a Bayesian-based algorithm known as BRAIN (Bayesian Rain retrieval Algorithm Including Neural network), which is described in the paper by Viltard et al. (2006). The retrieved rain rate is obtained through the use of a reference database built from a Radiative Transfer Model (RTM) simulation. In order to improve the simulation of the brightness temperatures, it is necessary to provide the RTM with an accurate parameterization of the ice particles. In this...

176. On Automated Lemma Generation for Separation Logic with Inductive Definitions - Enea, Constantin; Sighireanu, Mihaela; Wu, Zhilin
Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas relating the inductive definitions. We propose a novel approach for generating these lemmas automatically which is based on simple syntactic criteria and deterministic strategies for applying them. Our approach focuses on iterative programs, although it can be applied to recursive programs as well, and specifications that describe not only the shape of the data structures, but also their content or their size. Empirically, we find that our approach is...

177. Parallel postulates and decidability of intersection of lines: a mechanized study within Tarski's system of geometry - Boutry, Pierre; Narboux, Julien; Schreck, Pascal
In this paper we focus on the formalization of the proof of equivalence between different versions of Euclid's 5 th postulate. This postulate is of historical importance because for centuries many mathematicians believed that this statement was rather a theorem which could be derived from the first four of Euclid's postulates and history is rich of incorrect proofs of Euclid's 5 th postulate. These proofs are incorrect because they assume more or less implicitly a statement which is equivalent to Euclid's 5 th postulate and whose validity is taken for granted. Even though these proofs are incorrect the attempt was...

178. Primitive roots of bi-periodic infinite pictures - Bacquey, Nicolas
International audience

179. Full Abstraction for Signal Flow Graphs - Bonchi, Filippo; Sobocinski, Pawel; Zanasi, Fabio
International audience

180. The logic of design: towards a new research culture for South African architectural studies - Mills, Glen


Busque un recurso