Mostrando recursos 1 - 20 de 160

  1. Las fábricas de tabacos en España (1731-1945)

    Castañeda López, Carolina
    El objeto de la presente tesis es el estudio comparativo desde un enfoque arquitectónico y patrimonial de las fábricas tabacaleras en España surgidas bajo la gestión del monopolio hacendístico del tabaco. Con ello se pretende profundizar en la realidad arquitectónica que engloba un proceso de producción determinado, como es el del tabaco, históricamente asociado a la figura de la mujer como trabajadora y que define un tipo fabril característico en la formalización arquitectónica del espacio productivo. En este sentido, la investigación se ha centrado en aquellas fundaciones fabriles surgidas bajo la gestión de la Renta de Tabacos por parte de...

  2. Ruta metodológica para la construcción de un diseño curricular desde la formación basada en competencias para la educación superior: El caso de la formación profesional de pregrado

    Martin Calvo, Julio Alexander; Romero Garzón, Rodrigo
    La siguiente tesis de Maestría propone una ruta metodológica para construir un currículo desde la formación por competencias, el estudio se enmarca entre las llamadas metodologías cualitativas desde el estudio de caso, en el cual aparecieron aspectos relevantes y particulares como currículo, diseño curricular, competencias, rutas metodológicas, que se debían abordar a partir del estudio de caso colectivo, este se desarrolló en tres fases, de exploración, selección de unidades, de recogida, (análisis e interpretación). Desde un análisis documental a partir del registro de información con ayuda de matrices permitió develar cuales eran los aspectos teóricos, conceptuales y fases pertinentes que...

  3. Learning Commonalities in RDF and SPARQL

    El Hassad, Sara; Goasdoué, François; Jaudoin, Hélène
    Finding commonalities between descriptions of data or knowledge is a fundamental task in Machine Learning. The formal notion characterizing precisely such commonalities is known as least general generalization of descriptions and was introduced by G. Plotkin in the early 70's, in First Order Logic. Identifying least general generalizations has a large scope of database applications ranging from query optimization (e.g., to share commonalities between queries in view selection or multi-query optimization) to recommendation in social networks (e.g., to establish connections between users based on their commonalities between profiles or searches). To the best of our knowledge, this is the first...

  4. Encoding a Dependent-Type Lambda-Calculus in a Logic Programming Language

    Felty, Amy; Miller, Dale
    Various forms of typed λ-calculi have been proposed as specification languages for representing wide varieties of object logics. The logical framework, LF, is an example of such a dependent-type λ-calculus. A small subset of intuitionistic logic with quantification over simply typed λ-calculus has also been proposed as a framework for specifying general logics. The logic of hereditary Harrop formulas with quantification at all non-predicate types, denoted here as hhω, is such a meta-logic that has been implemented in both the Isabelle theorem prover and the λProlog logic programming language. Both frameworks provide for specifications of logics in which details involved...

  5. Step-Indexed Normalization for a Language with General Recursion

    Cainghino, Chris; Sjoberg, Vilhelm; Weirich, Stephanie
    The TRELLYS project has produced several designs for practical dependently typed languages. These languages are broken into two fragments—a logical fragment where every term normalizes and which is consistent when interpreted as a logic, and a programmatic fragment with general recursion and other convenient but unsound features. In this paper, we present a small example language in this style. Our design allows the programmer to explicitly mention and pass information between the two fragments. We show that this feature substantially complicates the metatheory and present a new technique, combining the traditional Girard–Tait method with step-indexed logical relations, which we use...

  6. Aristotle's ategorical Syllogisms as Dialectical Games. Work in Progress

    Rahman, Shahid; Crubellier, Michel; Mcconaughey, Zoe
    It is the introduction of book in Preparation on the links between Aristotle's Logic and his dialectics The main claim is that nowadays dialogical frame for logic provides the most accurate reconstruction of Arisotl'es general notion of logic

  7. Aristotle's ategorical Syllogisms as Dialectical Games. Work in Progress

    Rahman, Shahid; Crubellier, Michel; Mcconaughey, Zoe
    It is the introduction of book in Preparation on the links between Aristotle's Logic and his dialectics The main claim is that nowadays dialogical frame for logic provides the most accurate reconstruction of Arisotl'es general notion of logic

  8. Discourse 'Major Continuatives' in a Non Monotonic Framework

    Jayez, Jacques; Dargnat, Mathilde
    Delattre (1966) proposed a classification of French basic melodic contours. He defined in particular 'major continuatives' as melodic rises that mark the frontier between higher constituents in a hierarchy of clausal and sentential constituents. Although Delattre's empirical basis for his classification has been discussed, there is a strong intuition that some sort of melodic rise can be used in French at the frontier between discourse constituents. The goal of this paper is to explore this possibility in two directions. First, we provide experimental evidence that, taken in isolation, major continuatives are not significantly discriminated from interrogative contours by 'naïve' subjects,...

  9. Una lecture materialista de la colonialidad

    Trigo, Abril
    Es innegable la contribución de la teoría de la colonialidad del poder, propuesta por Aníbal Quijano, para un mejor entendimiento de los dispositivos de dominación en el sistema mundial moderno. Sin embargo, al poner el énfasis en los dispositivos cognitivos de dominación simbólica, la teoría prioriza la crítica de lo discursivo sobre el estudio de la materialidad histórico-­‐social, con lo cual el capitalismo resulta así un elemento más, casi un atributo, que no la clave de bóveda, de la modernidad. En una palabra, la falla de que adolece la formidable teoría de Quijano reside en no otorgar al capitalismo –como...

  10. Promoción comunitaria en salud mental: el Taller de Recursos Creativos en Salud

    Carnabali, Melisa Agustina; Contreras, Mercedes; Rodríguez, Nadia
    En el presente trabajo procuramos describir y analizar los aportes potenciales que presenta el Taller de Recursos Creativos en Salud al proceso salud-enfermedad-cuidado de lxs usuarixs que concurren al Hospital de Día del Higa Gral. San Martín de La Plata. El taller es coordinado por la Residencia de Trabajo Social desde el año 2001 habiendo variado en su formato a partir de revisiones periódicas. En un primer momento, el taller se inscribió como alternativa al modelo de atención dominante dentro de la institución, encontrando sus fundamentos en el paradigma de desmanicomialización, que pone de relieve las limitaciones de la perspectiva asilar-tutelar,...

  11. A decision procedure for satisfiability in separation logic with inductive predicates

    Brotherston, J; Fuhs, C; Pérez, JAN; Gorogiannis, N
    We show that the satisfiability problem for the "symbolic heap" fragment of separation logic with general inductively defined predicates- which includes most fragments employed in program verification - is decidable. Our decision procedure is based on the computation of a certain fixed point from the definition of an inductive predicate, called its "base", that exactly characterises its satisfiability. A complexity analysis of our decision procedure shows that it runs, in the worst case, in exponential time. In fact, we show that the satisfiability problem for our inductive predicates is EXPTIME- complete, and becomes NP-complete when the maximum arity over all...

  12. Foundations for decision problems in separation logic with general inductive predicates

    Antonopoulos, T; Gorogiannis, N; Haase, C; Kanovich, M; Ouaknine, J
    We establish foundational results on the computational complexity of deciding entailment in Separation Logic with general inductive predicates whose underlying base language allows for pure formulas, pointers and existentially quantified variables. We show that entailment is in general undecidable, and ExpTime-hard in a fragment recently shown to be decidable by Iosif et al. Moreover, entailment in the base language is Π2P-complete, the upper bound even holds in the presence of list predicates. We additionally show that entailment in essentially any fragment of Separation Logic allowing for general inductive predicates is intractable even when strong syntactic restrictions are imposed. © 2014...

  13. Foundations for decision problems in separation logic with general inductive predicates

    Antonopoulos, T; Gorogiannis, N; Haase, C; Kanovich, M; Ouaknine, J
    We establish foundational results on the computational complexity of deciding entailment in Separation Logic with general inductive predicates whose underlying base language allows for pure formulas, pointers and existentially quantified variables. We show that entailment is in general undecidable, and ExpTime-hard in a fragment recently shown to be decidable by Iosif et al. Moreover, entailment in the base language is Π2P-complete, the upper bound even holds in the presence of list predicates. We additionally show that entailment in essentially any fragment of Separation Logic allowing for general inductive predicates is intractable even when strong syntactic restrictions are imposed. © 2014...

  14. Inteligencia lógica y rendimiento académico en matemáticas: un estudio con estudiantes de Educación Básica y Secundaria de Chile

    Cerda, Gamal; Ortega Ruiz, Rosario; Pérez Wilson, Carlos E.; Flores, César; Melipillán, Roberto
    Este trabajo presenta los resultados de un estudio en la pobla-ción escolar chilena llevados a cabo en una muestra representativa del colectivo de estudiantes de Educación Básica y Media (N=4446), sobre un Test de Inteligencia Lógica Superior (TILS). Los resultados del análisis de las propiedades psicométricas indican que la escala TILS resulta ser un instrumento unidimensional, con adecuada consistencia interna. El análisis de los resultados de su aplicación, en la muestra de estudiantes chilenos, permite observar diferencias significativas en el nivel de inteligencia lógica en función de la edad, sexo y dependencia administrativa del estableci-miento al cual asisten los estudiantes....

  15. Inteligencia lógica y rendimiento académico en matemáticas: un estudio con estudiantes de Educación Básica y Secundaria de Chile

    Cerda, Gamal; Pérez Wilson, Carlos E.; Flores, César; Melipillán, Roberto; Ortega Ruiz, Rosario
    Este trabajo presenta los resultados de un estudio en la pobla-ción escolar chilena llevados a cabo en una muestra representativa del colectivo de estudiantes de Educación Básica y Media (N=4446), sobre un Test de Inteligencia Lógica Superior (TILS). Los resultados del análisis de las propiedades psicométricas indican que la escala TILS resulta ser un instrumento unidimensional, con adecuada consistencia interna. El análisis de los resultados de su aplicación, en la muestra de estudiantes chilenos, permite observar diferencias significativas en el nivel de inteligencia lógica en función de la edad, sexo y dependencia administrativa del estableci-miento al cual asisten los estudiantes....

  16. Optimal path planning under temporal logic constraints

    Smith, Stephen L.; Tumova, Jana; Belta, Calin; Rus, Daniela L.
    In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the environment is modeled as a weighted transition system. The mission is specified by a general linear temporal logic formula. In addition, we require that an optimizing proposition must be repeatedly satisfied. The cost function that we seek to minimize is the maximum time between satisfying instances of the optimizing proposition. For every environment model, and for every formula, our method computes a robot trajectory which minimizes the cost function. The problem is motivated by robotic...

  17. Analysis of Structural Causes of Mass Rape in the Democratic Republic of Congo: An Integrated Perspective

    Brown, Kathryn
    The Democratic Republic of Congo has seen unprecedented levels of sexual violence in the last fifteen years. Explanations for the level of mass rape are varied and lack a consensus. I analyze the three broadest causes of mass rape: political, economic, and sociocultural, in terms of structural violence. Each cause is analyzed with rape theory framework, beginning with the general logic and incentive behind mass rape and then compared against the Congo. While each structural cause has strong points, each are unsatisfactory independently. Thus, I conclude that an integrated approach considering all three causes of excess mass rape in the...

  18. An Asymmetric Protocol for Argumentation Games in Defeasible Logic

    Eriksson Lundström, Jenny; Governatori, Guido; Thakur, Subhasis; Padmanabhan, Vineet
    Agent interactions where the agents hold conflicting goals could be modelled as adversarial argumentation games. In many real-life situations (e.g., criminal litigation, consumer legislation), due to ethical, moral or other principles governing interaction, the burden of proof, i.e., which party is to lose if the evidence is balanced [4], is a priori fixed to one of the parties. Analogously, when resolving disputes in a heterogeneous agent-system the unequal importance of different agents for carrying out the overall system goal need to be accounted for. In this paper we present an asymmetric protocol for an adversarial argumentation game in Defeasible Logic,...

  19. Dialogue Games in Defeasible Logic

    Thakur, Subhasis; Governatori, Guido; Padmanabhan, Vineet; Eriksson Lundstrom, Jenny
    In this paper we show how to capture dialogue games in Defeasible Logic. We argue that Defeasible Logic is a natural candidate and general representation formalism to capture dialogue games even with requirements more complex than existing formalisms for this kind of games. We parse the dialogue into defeasible rules with time of the dialogue as time of the rule. As the dialogue evolves we allow an agent to upgrade the strength of unchallenged rules. The proof procedures of (Antoniou, Billington, Governatori, Maher 2001) are used to determine the winner of a dialogue game.

  20. A Compact Argumentation System for Agent System Specification

    Song, I.; Governatori, G.
    We present a non-monotonic logic tailored for specifying compact autonomous agent systems. The language is a consistent instantiation of a logic based argumentation system extended with Brooks' subsumption concept and varying degree of belief. Particularly, we present a practical implementation of the language by developing a meta-encoding method that translates logical specifications into compact general logic programs. The language allows n-ary predicate literals with the usual first-order term definitions. We show that the space complexity of the resulting general logic program is linear to the size of the original theory.

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.