Wednesday, September 2, 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 148,852

161. Espacio urbano y desigualdades: las políticas públicas y privadas en la ciudad de Córdoba, Argentina (1990- 2011) - Capdevielle, Julieta
One of the characteristics of Latin American cities is the persistent and even growing inaccessibility to cheap land, well located and in living conditions and health for large segments of the population (Morales- Schechinger, 2005). The politics of urban land uses in the region are subject to capitalist logic, in recent times, was secured as a core criterion in shaping these cities (Marengo, 2013). At the same time, the production process and urban space is characterized by an ever closer relationship between the state and business groups. This article aims, in the first instance, to analyze the relationship between inequality...

162. Algunos elementos para la configuración de Estados-plurinacionales en América Latina desde la mirada de los derechos indígenas. - Bustillos Ramírez, Linda María
At present, there are elements and arguments to affirm that our societies will be inclusive in all areas and with cultures, with a state that emerges from the idea of national plurality as a basis for the constructions of various diverse and intercultural public spaces. Thus, until the nation-states of Latin America do not transit towards plurinationalism, with all that that expresses and implies, indigenous rights will be inconclusive and less likely to materialize, inside the logic for a state apparatus whose structures have been designed for a monocultural society.

163. Mecanismos de explotación sexual de niñas y adolescentes en los alrededores del puerto fluvial de Pucallpa - Mujica, Jaris; Cavagnoud, Robin
La explotación sexual de niñas y adolescentes es un fenómeno que ha crecido con la expansión de las industrias extractivas (de madera, petróleo, minerales y gas) en la Amazonía peruana. El artículo es parte de una larga investigación en la ciudad de Pucallpa y la ruta norte del río Ucayali, y tiene como objetivo central mostrar la dinámica económica de los mecanismos de explotación sexual comercial de niñas y adolescentes en los alrededores del principal puerto fluvial. Se estudia los mecanismos de explotación local de los bares y restaurantes del puerto, la demanda y las percepciones sobre la explotación sexual...

164. ELPI: fast, Embeddable, λProlog Interpreter - Dunchev, Cvetan; Guidi, Ferruccio; Sacerdoti Coen, Claudio; Tassi, Enrico
International audience

165. Towards Applying Logico-numerical Control to Dynamically Partially Reconfigurable Architectures - Berthier, Nicolas; An, Xin; Marchand, Hervé
International audience

166. Una batalla ganada: la eliminación de la poliomielitis en Cuba - Chaple,Enrique Beldarraín
La poliomielitis fue introducida en Cuba a finales del siglo XIX por norteamericanos residentes en Isla de Pinos. Las primeras epidemias ocurrieron en 1906 y 1909, aumentaron en intensidad entre 1930-1958. El objetivo del artículo es reconstruir la historia de la enfermedad y sus epidemias en Cuba hasta 1961, de la primera Campaña Nacional de Vacunación Antipolio (1962) y de sus resultados, bien como analizar la continuidad de las campañas anuales de vacunación hasta la certificación de su eliminación (1994). Se siguió el método histórico lógico; se revisaron documentos de archivos, las estadísticas del Ministerio de Salud Pública sobre morbilidad...

167. A produção de conhecimento sobre juventude(s), vulnerabilidades e violências: uma análise da pós-graduação brasileira nas áreas de Psicologia e Saúde (1998-2008) - Takeiti,Beatriz Akemi; Vicentin,Maria Cristina Gonçalves
Estudiosos de diferentes campos do saber têm alertado para aspectos recorrentes e problemáticos da produção de conhecimento em relação ao jovem e suas condições sociais. As pesquisas apontam que, ao tratar do tema, estes estudos o fazem quase sempre a partir dos "problemas" que a juventude apresenta, desconsiderando a compreensão dos modos de vida e das experiências cotidianas que a atravessam. O objetivo deste artigo é refletir sobre como as pesquisas acadêmicas brasileiras têm pensado o jovem na atualidade, num diálogo com outros estados da arte já realizados acerca deste tema. Optamos por levantar teses de doutorado e dissertações de...

168. Valoración de las pruebas de declaración de personas en segunda instancia - Contreras Rojas, Cristian
La valoración de las declaraciones personales debe corresponder al producto de un ejercicio racional y lógico realizado por el juez, de modo que ella no solo pueda ser conocida y compartida por las partes y el resto de ciudadanos, sino también sometida al examen del tribunal de segunda instancia. Para eso se necesita contar con criterios objetivos y contrastables que posibiliten el desarrollo de inferencias sólidas y correctas a partir del resultado de las declaraciones. Este trabajo analiza el proceso inferencial que debe desarrollar el sentenciador mediante el cotejo de dichos criterios y el resultado de las declaraciones, pues solo...

169. An adequate logic for Full LOTOS - Muffy Calder; Savi Maharaj; Carron Shankl

170. Reducing separation formulas to propositional logic - Ofer Strichman; Sanjit A. Seshia; Randal E. Bryant
A short version of this report titled ‘Deciding Separation Formulas with SAT ’ appeared

171. Semantic Metrics - Bo Hu; Yannis Kalfoglou; Harith Alani, David Dupplaw; Paul Lewis; Nigel Shadbolt
In the context of the Semantic Web, many ontology-related operations, e.g. ontology ranking, segmentation, alignment, articulation, reuse, evaluation, can reduced to one fundamental operation: computing the similarity and/or dissimilarity among ontological entities, and in some cases among ontologies themselves. In this paper, we review standard metrics for computing distance measures and we propose a series of semantic metrics. We give a formal account of semantic metrics drawn from a variety of research disciplines, and enrich them with semantics based on standard Description Logic constructs. We argue that concept-based metrics can be aggregated to produce numeric distances at ontology-level and we...

172. Abstract - Mutsunori Banbara; Naoyuki Tamura
There have been several proposals for logic programming language based on linear logic: Lolli [6], Lygon [5], LO [3], LinLog [2], Forum [8]. In addition, BinProlog allows the use of linear implications of affine logic (a variant of linear logic) [12, 13]. In these languages, it is possible to create and consume resources dynamically as logical formulas. The efficient handling of resource formulas is therefore an important issue in the implementation of these languages. In [10], N. Tamura and Y. Kaneda proposed an abstract machine called LLPAM which is an extension of the standard WAM [14, 1] for a linear...

173. $rec.titulo
ABSTRACT Tableau-based proof systems can be elegantly specified and directly executed by a tabled Logic Programming (LP) system. Our experience with the XMC model checker shows that such an encoding can be used to search for the existence of a proof very efficiently. However, the users of a tableau system are often interested in getting sufficient evidence (in terms of the tableau proof rules) on why a proof does or does not exist. In this paper, we address the problem of constructing such an evidence without introducing any additional computational overhead to the proof search. A tabled LP system maintains...

174. Modelling Digital Logic in SDL - Tadanori Mizuno; Norio Shiratori; Teruo Higashino; G. Csopaki A; K. J. Turner B
The specification of digital logic in SDL (Specification and Description Language) is investigated. A specification approach is proposed for multi-level descriptions of hardware behaviour and structure. The modelling method exploits features introduced in SDL-92. The approach also deals with the specification, analysis and simulation of timing aspects at any level in the specification of digital logic.

175. $rec.titulo
The use of large instruction windows coupled with aggressive out-oforder and prefetching capabilities has provided significant improvements in processor performance. In this paper, we quantify the effects of increased out-of-order aggressiveness on a processor’s memory ordering/consistency model as well as an application’s cache behavior. We observe that increasing reorder buffer sizes cause less than one third of issued memory instructions to be executed in actual program order. We show that increasing the reorder buffer size from 80 to 512 entries results in an increase in the frequency of memory traps by a factor of six and an increase in total...

176. Connecting a Logical Framework to aFirst-Order Logic Prover
Abstract. We present one way of combining a logical framework and first-orderlogic. The logical framework is used as an interface to a first-order theorem prover. Its main purpose is to keep track of the structure of the proof and to dealwith the high level steps, for instance, induction. The steps that involve purely propositional or simple first-order reasoning are left to a first-order resolutionprover (the system Gandalf in our prototype). The correctness of this interaction is based on a general meta-theoretic result. One feature is the simplicity of ourtranslation between the logical framework and first-order logic, which uses implicit typing....

177. Decidable fragments of first-order temporal logics - Ian Hodkinson; Frank Wolter; Michael Zakharyaschev
In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first-order logic. This reduction is then used to single out a number of decidable fragments of first-order temporal logics and of two-sorted first-order logics in which one sort is intended for temporal reasoning. Besides standard first-order time structures,...

178. A security logic for Abstract State Machines - Stanislas Nanchen; Robert F. Stärk
Abstract. We extend the logic for Abstract State Machines by a read predicate that allows to make precise statements about the accesses of locations of an ASM. The logic can be used to prove security properties of ASMs like that the machine does not read locations containing critical information or that all accesses of the machine are in a well-defined region of the abstract memory. The new read predicate is also useful for proving refinements of parallel ASMs to sequential C-like programs. The logic is complete for hierarchical ASMs and still sound for turbo ASMs. It is integrated in the...

179. Implementing the Meta-Theory of Deductive Systems - Frank Pfenning; Ekkehard Rohwedder
Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an operational semantics in the spirit of logic programming. It is based on the mechanical verification of properties of transformations between deductions, which relies on type reconstruction and schema-checking. The latter is justified by induction principles for closed LF objects, which can be constructed over a given signature. We illustrate our technique through several examples, the most extensive of which is an interpretation of classical logic in minimal logic through a continuation-passing-style transformation on proofs....

180. Convergence Testing in Term-Level Bounded Model Checking?
Abstract. We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an arbitrary system, it converges for many practical examples, including pipelined processors. We give a new formal definition of convergence that generalizes previously stated criteria. We also give a sound semi-decision procedure to check this criterion based on a translation to quantified separation logic. Preliminary results on simple pipeline processor models are presented.

 

Busque un recurso