Nova Talenta: 2015-2016

Introducción -- Liderazgo transformacional e inteligencia emocional: una revisión / Gina Paola Cortés Agudelo, Olga Lucia Lacouture -- El liderazgo transformacional y sus implicaciones en la cultura organizacional: una revisión de la literatura / Alejandro Arévalo, Iván Suárez, Jhon Zuluaga -- Liderazgo femenino: una revisión a la literatura / David Leonardo Méndez Sarmiento, María José Cruz Mancheno -- Liderazgo adaptativo y las relaciones de aprendizaje: implicaciones para las organizaciones actuales / María Alejandra Avella Torres, Laura Katherine Umaña Roa -- Inteligencia emocional y su relación con el liderazgo de rango total / Diego Stiven García Morales, Mohamed zakaria el arksoussi fakih -- Influencia del liderazgo transformacional y transaccional sobre la calidad de vida laboral en las empresas / María Paula Ordoñez Valencia -- Discriminación y desigualdad de género : situación actual de las mujeres en el mundo empresarial / Daniela Andrade Palau / Natalia Villarreal Rodríguez -- Competitividad: análisis comparativo entre Colombia y chile desde la perspectiva de la innovación / Álvaro David Buenaventura Maya.

Emergetic evaluation of cattle rearing in a montado farm

O Montado, em Portugal, é um complexo sistema silvopastoril de uso da terra, tipicamente Mediterrânico, com diversos estratos de vegetação, incluindo sobreiro e azinheira em várias densidades, onde é frequente a criação de gado. Esta actividade pecuária beneficia das pastagens no sob-coberto, de algumas espécies arbustivas e também das bolotas que caem do coberto arbóreo, contribuindo para evitar a invasão da pastagem por matos. No entanto, dependendo da sua gestão, este gado pode comprometer a regeneração do sistema. Nos últimos 20 anos, os subsídios no âmbito da Política Agrícola Comum da União Europeia têm promovido a criação de gado bovino em detrimento de outras espécies e raças mais leves, bem como a intensificação desta produção. Esta intensificação pode impossibilitar a regeneração natural das árvores ameaçando o equilíbrio do Montado. Por esta razão é necessária uma avaliação focada na criação de gado bovino e nos seus impactos sobre o sistema. O objectivo deste estudo foi obter uma melhor compreensão do funcionamento de uma exploração silvopastoril num sistema de Montado, através da aplicação do Método de Avaliação Emergética e do cálculo de índices emergéticos. Pretende-se assim compreender a melhor forma de o gerir, bem como conceber estratégias que maximizem o fluxo de emergia na exploração. Uma comparação deste método com a avaliação económica permitiu perceber em que aspectos esta pode ser complementada pelo método da avaliação emergética. O método da avaliação emergética permite a avaliação de sistemas multifuncionais complexos à escala de uma exploração individual, fornecendo informação extra em relação à avaliação económica como a renovabilidade dos inputs do sistema, ou a quantidade de fluxos livres da natureza que é valorada por preços de mercado. Este método permite a integração das emternalidades e das externalidades à contabilização económica, transformando uma avaliação tendencialmente separada do seu sistema mais vasto, numa avaliação de um sistema em conexão com aqueles mais vastos nos quais se integra; Abstract: The Montado, in Portugal, is a complex silvo-pastoral system of land use, typically Mediterranean, with different strata of vegetation, including cork and holm oaks in various densities, and where cattle rearing is common. This stockfarm benefits from the herbaceous layer under the trees, as well as from some species in the shrub layer, and also from the acorns faling down from the tree cover, while contributing to prevent the invasion of pastures by shrubs. Nevertheless, depending on its management, livestock can affect the system regeneration. Over the past 20 years, subsidies of the European Union's common agricultural policy have promoted the cattle rearing at expense of other lighter species and breeds, as well as its intensification. This intensification may impair the natural regeneration of trees threatening the balance of the Montado. Therefore an assessment focused on cattle and their impact on the system is required. The purpose of this study was to obtain a better understanding of the functioning of a silvo-pastoral farm in a Montado system, by applying the emergy evaluation method and through the calculation of emergy indices. It is intended to understand the best way to manage and design strategies that maximize the emergy flow on the farm. A comparison of this method with the economic evaluation allowed to realize in what aspects it can be complemented by the emergy evaluation method. The emergy evaluation method alows the assessment of complex multi-functional systems at the scale of an individual farm, providing extra information in relation to economic avaluation as the renewability of the inputs to a system and the amount of free flows of nature that is valued by market prices. This method allows the integration of the emternalities and the externalities to the economic accounting, transforming an evaluation tended separated from its wider system, in an evaluation of a system in connection with the larger ones on which it is incorporated.

Comparative constitutional design for divided societies: a model to explain vonstitutional asymmetries

Comparative studies on constitutional design for divided societies indicate that there is no magic formula to the challenges that these societies pose, as lots of factors influence constitutional design. In the literature on asymmetric federalism, the introduction of constitutional asymmetries is considered a flexible instrument of ethnic conflict resolution, as it provides a mixture of the two main theoretical approaches to constitutional design for divided societies (i.e., integration and accommodation). Indeed, constitutional asymmetries are a complex and multifaceted phenomenon, as their degree of intensity can vary across constitutional systems, and there are both legal and extra-legal factors that may explain such differences. This thesis argues that constitutional asymmetries provide a flexible model of constitutional design and aims to explore the legal factors that are most likely to explain the different degrees of constitutional asymmetry in divided multi-tiered systems. To this end, the research adopts a qualitative methodology, i.e., Qualitative Comparative Analysis (QCA), which allows an understanding of whether a condition or combination of conditions (i.e., the legal factors) determine the outcome (i.e., high, medium, low degree of constitutional asymmetry, or constitutional symmetry). The QCA is conducted on 16 divided multi-tiered systems, and for each case, the degree of constitutional asymmetry was analyzed by employing standardized indexes on subnational autonomy, allowing for a more precise measure of constitutional asymmetry than has previously been provided in the literature. Overall, the research confirms the complex nature of constitutional asymmetries, as the degrees of asymmetries vary substantially not only across systems but also within cases among the dimensions of subnational autonomy. The outcome of the Qualitative Comparative Analysis also confirms a path of complex causality since the different degrees of constitutional asymmetry always depend on several legal factors, that combined produce a low, medium, or high degree of constitutional asymmetry or, conversely, constitutional symmetry.

Addressing the facilities layout design problem through constraint logic programming

One of the most difficult problems that face researchers experimenting with complex systems in real world applications is the Facility Layout Design Problem. It relies with the design and location of production lines, machinery and equipment, inventory storage and shipping facilities. In this work it is intended to address this problem through the use of Constraint Logic Programming (CLP) technology. The use of Genetic Algorithms (GA) as optimisation technique in CLP environment is also an issue addressed. The approach aims the implementation of genetic algorithm operators following the CLP paradigm.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Relational and Allegorical Semantics for Constraint Logic Programming

El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarrollado en gran medida por Peirce y Schröder. Tarski, Givant, Freyd y Scedrov demostraron que las álgebras relacionales son capaces de formalizar la lógica de primer orden, la lógica de orden superior así como la teoría de conjuntos. A partir de los resultados matemáticos de Tarski y Freyd, esta tesis desarrolla semánticas denotacionales y operacionales para la programación lógica con restricciones usando el álgebra relacional como base. La idea principal es la utilización del concepto de semántica ejecutable, semánticas cuya característica principal es el que la ejecución es posible utilizando el razonamiento estándar del universo semántico, este caso, razonamiento ecuacional. En el caso de este trabajo, se muestra que las álgebras relacionales distributivas con un operador de punto fijo capturan toda la teoría y metateoría estándar de la programación lógica con restricciones incluyendo los árboles utilizados en la búsqueda de demostraciones. La mayor parte de técnicas de optimización de programas, evaluación parcial e interpretación abstracta pueden ser llevadas a cabo utilizando las semánticas aquí presentadas. La demostración de la corrección de la implementación resulta extremadamente sencilla. En la primera parte de la tesis, un programa lógico con restricciones es traducido a un conjunto de términos relacionales. La interpretación estándar en la teoría de conjuntos de dichas relaciones coincide con la semántica estándar para CLP. Las consultas contra el programa traducido son llevadas a cabo mediante la reescritura de relaciones. Para concluir la primera parte, se demuestra la corrección y equivalencia operacional de esta nueva semántica, así como se define un algoritmo de unificación mediante la reescritura de relaciones. La segunda parte de la tesis desarrolla una semántica para la programación lógica con restricciones usando la teoría de alegorías—versión categórica del álgebra de relaciones—de Freyd. Para ello, se definen dos nuevos conceptos de Categoría Regular de Lawvere y _-Alegoría, en las cuales es posible interpretar un programa lógico. La ventaja fundamental que el enfoque categórico aporta es la definición de una máquina categórica que mejora e sistema de reescritura presentado en la primera parte. Gracias al uso de relaciones tabulares, la máquina modela la ejecución eficiente sin salir de un marco estrictamente formal. Utilizando la reescritura de diagramas, se define un algoritmo para el cálculo de pullbacks en Categorías Regulares de Lawvere. Los dominios de las tabulaciones aportan información sobre la utilización de memoria y variable libres, mientras que el estado compartido queda capturado por los diagramas. La especificación de la máquina induce la derivación formal de un juego de instrucciones eficiente. El marco categórico aporta otras importantes ventajas, como la posibilidad de incorporar tipos de datos algebraicos, funciones y otras extensiones a Prolog, a la vez que se conserva el carácter 100% declarativo de nuestra semántica. ABSTRACT The calculus of binary relations was introduced by De Morgan in 1860, to be greatly developed by Peirce and Schröder, as well as many others in the twentieth century. Using different formulations of relational structures, Tarski, Givant, Freyd, and Scedrov have shown how relation algebras can provide a variable-free way of formalizing first order logic, higher order logic and set theory, among other formal systems. Building on those mathematical results, we develop denotational and operational semantics for Constraint Logic Programming using relation algebra. The idea of executable semantics plays a fundamental role in this work, both as a philosophical and technical foundation. We call a semantics executable when program execution can be carried out using the regular theory and tools that define the semantic universe. Throughout this work, the use of pure algebraic reasoning is the basis of denotational and operational results, eliminating all the classical non-equational meta-theory associated to traditional semantics for Logic Programming. All algebraic reasoning, including execution, is performed in an algebraic way, to the point we could state that the denotational semantics of a CLP program is directly executable. Techniques like optimization, partial evaluation and abstract interpretation find a natural place in our algebraic models. Other properties, like correctness of the implementation or program transformation are easy to check, as they are carried out using instances of the general equational theory. In the first part of the work, we translate Constraint Logic Programs to binary relations in a modified version of the distributive relation algebras used by Tarski. Execution is carried out by a rewriting system. We prove adequacy and operational equivalence of the semantics. In the second part of the work, the relation algebraic approach is improved by using allegory theory, a categorical version of the algebra of relations developed by Freyd and Scedrov. The use of allegories lifts the semantics to typed relations, which capture the number of logical variables used by a predicate or program state in a declarative way. A logic program is interpreted in a _-allegory, which is in turn generated from a new notion of Regular Lawvere Category. As in the untyped case, program translation coincides with program interpretation. Thus, we develop a categorical machine directly from the semantics. The machine is based on relation composition, with a pullback calculation algorithm at its core. The algorithm is defined with the help of a notion of diagram rewriting. In this operational interpretation, types represent information about memory allocation and the execution mechanism is more efficient, thanks to the faithful representation of shared state by categorical projections. We finish the work by illustrating how the categorical semantics allows the incorporation into Prolog of constructs typical of Functional Programming, like abstract data types, and strict and lazy functions.

Using attributed variables in the implementation of concurrent and parallel logic programming systems

Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to it. This approach is very attractive in that by adding a few primitives any logic programming system can be turned into a generic constraint logic programming system in which constraint solving can be user deñned, and at source level - an extreme example of the "glass box" approach. In this paper we propose a different and novel use for the concept of attributed variables: developing a generic parallel/concurrent (constraint) logic programming system, using the same "glass box" flavor. We argüe that a system which implements attributed variables and a few additional primitives can be easily customized at source level to implement many of the languages and execution models of parallelism and concurrency currently proposed, in both shared memory and distributed systems. We illustrate this through examples and report on an implementation of our ideas.

On the uses of attributed variables in parallel and concurrent logic programming systems

Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to it. This approach is very attractive in that by adding a few primitives any logic programming system can be turned into a generic constraint logic programming system in which constraint solving can be user defined, and at source level - an extreme example of the "glass box" approach. In this paper we propose a different and novel use for the concept of attributed variables: developing a generic parallel/concurrent (constraint) logic programming system, using the same "glass box" flavor. We argüe that a system which implements attributed variables and a few additional primitives can be easily customized at source level to implement many of the languages and execution models of parallelism and concurrency currently proposed, in both shared memory and distributed systems. We illustrate this through examples.

Machine ethics via logic programming

Machine ethics is an interdisciplinary field of inquiry that emerges from the need of imbuing autonomous agents with the capacity of moral decision-making. While some approaches provide implementations in Logic Programming (LP) systems, they have not exploited LP-based reasoning features that appear essential for moral reasoning. This PhD thesis aims at investigating further the appropriateness of LP, notably a combination of LP-based reasoning features, including techniques available in LP systems, to machine ethics. Moral facets, as studied in moral philosophy and psychology, that are amenable to computational modeling are identified, and mapped to appropriate LP concepts for representing and reasoning about them. The main contributions of the thesis are twofold. First, novel approaches are proposed for employing tabling in contextual abduction and updating – individually and combined – plus a LP approach of counterfactual reasoning; the latter being implemented on top of the aforementioned combined abduction and updating technique with tabling. They are all important to model various issues of the aforementioned moral facets. Second, a variety of LP-based reasoning features are applied to model the identified moral facets, through moral examples taken off-the-shelf from the morality literature. These applications include: (1) Modeling moral permissibility according to the Doctrines of Double Effect (DDE) and Triple Effect (DTE), demonstrating deontological and utilitarian judgments via integrity constraints (in abduction) and preferences over abductive scenarios; (2) Modeling moral reasoning under uncertainty of actions, via abduction and probabilistic LP; (3) Modeling moral updating (that allows other – possibly overriding – moral rules to be adopted by an agent, on top of those it currently follows) via the integration of tabling in contextual abduction and updating; and (4) Modeling moral permissibility and its justification via counterfactuals, where counterfactuals are used for formulating DDE.

A logic programming framework for possibilistic argumentation: formalization and logical properties

In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable to deal with explicit uncertainty, nor with vague knowledge, as defeasibility is directly encoded in the object language. This paper presents Possibilistic Logic Programming (P-DeLP), a new logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty. Such features are formalized on the basis of PGL, a possibilistic logic based on G¨odel fuzzy logic. One of the applications of P-DeLP is providing an intelligent agent with non-monotonic, argumentative inference capabilities. In this paper we also provide a better understanding of such capabilities by defining two non-monotonic operators which model the expansion of a given program P by adding new weighed facts associated with argument conclusions and warranted literals, respectively. Different logical properties for the proposed operators are studied

Parallelizing irregular and pointer-based computations automatically: perspectives from logic and constraint programming

Irregular computations pose sorne of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures, which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence detection to task partitioning and placement. Starting in the mid 80s there has been significant progress in the development of parallelizing compilers for logic pro­gramming (and more recently, constraint programming) resulting in quite capable paralle­lizers. The typical applications of these paradigms frequently involve irregular computations, and make heavy use of dynamic data structures with pointers, since logical variables represent in practice a well-behaved form of pointers. This arguably makes the techniques used in these compilers potentially interesting. In this paper, we introduce in a tutoríal way, sorne of the problems faced by parallelizing compilers for logic and constraint programs and provide pointers to sorne of the significant progress made in the area. In particular, this work has resulted in a series of achievements in the areas of inter-procedural pointer aliasing analysis for independence detection, cost models and cost analysis, cactus-stack memory management, techniques for managing speculative and irregular computations through task granularity control and dynamic task allocation such as work-stealing schedulers), etc.