Search

The main objective of this study was to identify the relationship between performance parameters and the probability that a team will win or lose during regular season games. A retrospective observational study of a professional rugby team with thirty players and sixteen regular season games was conducted. Analyzes included the following metrics: open play carries, winline success, gainline failure, good pass, average pass, bad pass, good kick, average kick, bad kick, effective ruck, ruck ineffective, dominant tackle, neutral tackle, passive tackle, assisted tackle, missed tackle, defender in position, good offload, kick fielded, kick fielded unsuccessful, loose ball, interception, turnover made, line break, yellow card , red card, penalty awarded, try scored, injury, player out, player on, successful kick at goal, missed kick at goal, lineout, lineout won, scrum, scrum won, return to play, ruck speed and tackle completion. No single parameter could be directly related to profit or loss. However, four parameters when pooled could be associated with winning during the analyzed season (r = 0.897, r2 = 0.805, adjusted r = 0.635, p < 0.05): win-line success (p < 0.002), effective ruck (p<0.009), dominant tackle (p<0.018) and assisted tackle (p<0.029). In this specific context, coaches and professionals should pay more attention to these specific actions to improve team performance., El objetivo principal de este estudio fue identificar la relación entre los parámetros de rendimiento y la probabilidad de que un equipo gane o pierda durante los partidos de la temporada regular. Se realizó un estudio observacional retrospectivo de un equipo de rugby profesional con treinta jugadores y dieciséis partidos de temporada regular. Los análisis incluyeron las siguientes métricas: acarreos en juego abierto, éxito en la línea de ganancia, fracaso en la línea de ganancia, buen pase, pase promedio, mal pase, patada buena, patada promedio, patada mala, ruck efectivo, ruck ineficaz, tackle dominante, tackle neutral, tackle pasivo , tackle asistido, tackle fallado, defensor en posición, buena descarga, patada fildeada con éxito, patada fildeada sin éxito, balón perdido, intercepción, pérdida de balón realizada, rotura de línea, tarjeta amarilla, tarjeta roja, penal concedido, try anotado, lesión, jugador fuera, jugador encendido, patada exitosa al gol, patada fallida al gol, lineout, lineout ganado, scrum, scrum ganado, regreso al juego, velocidad del ruck y finalización del tackle. Ningún parámetro único podría estar directamente relacionado con ganancias o pérdidas. Sin embargo, cuatro parámetros cuando se agruparon podrían estar asociados con ganar durante la temporada analizada (r = 0.897, r2 = 0.805, r ajustado = 0.635, p< 0.05): éxito en la línea de ganancia (p<0.002), ruck efectivo (p<0.009), tackle dominante (p<0,018) y tackle asistido (p<0,029). En este contexto específico, los entrenadores y profesionales deberían prestar más atención a estas acciones específicas para mejorar el rendimiento del equipo.

El papel de la variación genética en las enfermedades humanas es bien conocido. Cambios en el ADN (genotipo en el genoma) de las personas “explican” las enfermedades monogénicas, y contribuyen a su desarrollo, progreso y severidad; también de patologías o rasgos complejos, así como influyen en la respuesta de posibles tratamientos. Sin restarle valor a los estudios clásicos de genética molecular, la implementación de las tecnologías de secuenciación masiva del ADN en investigación biológica y en la práctica de la medicina clínica ha acelerado la detección tanto de cambios comunes [en la población] como los de baja o muy baja frecuencia, favoreciendo el progreso en la caracterización de un gran número de enfermedades genéticas. Junto al desarrollo de nuevas herramientas bioinformáticas de análisis de datos, igualmente se ha mejorado de forma significativa en la detección e interpretación de variantes. Todos estos avances no restan importancia a la evidencia de que todavía es necesario seguir trabajando para prevenir estas enfermedades y mejorar la vida de las personas afectadas.

This work proposes an alternative definition of the so-called program transformers used to obtain reduction axioms in the Logic of Communication and Change (LCC). Our proposal uses an elegant matrix treatment of Brzozowski’s equational method instead of Kleene’s translation from finite automata to regular expressions. The two alternatives are shown to be equivalent, with Brzozowski’s method having the advantage of generating smaller expressions for models with average connectivity.

In this article, we study a dialogue-based approach to multi-agent collaborative plan search in the framework of t-DeLP, an extension of DeLP for defeasible temporal reasoning. In t-DeLP programs, temporal facts and rules combine into arguments, which compare against each other to decide which of their conclusions are to prevail. By adding temporal actions for multiple agents to this argumentative logic programming framework, one obtains a centralized planning framework. In this planning system, it can be shown that breadth-first search is sound and complete for both forward and backward planning. The main contribution is to extend these results in centralized planning to cooperative planning tasks, where the executing agents themselves are assumed to have reasoning and planning abilities. In particular, we propose a planning algorithm where agents exchange information on plans using suitable dialogues. We show that the soundness and completeness properties of centralized t-DeLP plan search are preserved, so the dialoguing agents will reach an agreement upon a joint plan if and only if some solution exists.

In public announcement logic it is assumed that all agents pay attention to the announcement. Weaker observational conditions can be modelled in action model logic. In this work, we propose a version of public announcement logic wherein it is encoded in the states of the epistemic model which agents pay attention to the announcement. This logic is called attention-based announcement logic. We give an axiomatization of the logic and prove that complexity of satisfiability is the same as that of public announcement logic, and therefore lower than that of action model logic. An attention-based announcement can also be described as an action model. We extend our logic by integrating attention change. Finally, we add the notion of common belief to the language, we exploit this to formalize the concept of joint attention, that has been widely discussed in the philosophical and cognitive science literature, and we provide a corresponding axiomatization. This axiomatization also employs the auxiliary notion of attention-based relativized common belief.

The aim of this paper is to propose an argumentation-based defeasible logic, called t-DeLP, that focuses on forward temporal reasoning for causal inference. We extend the language of the DeLP logical framework by associating temporal parameters to literals. A temporal logic program is a set of basic temporal facts and (strict or defeasible) durative rules. Facts and rules combine into durative arguments representing temporal processes. As usual, a dialectical procedure determines which arguments are undefeated, and hence which literals are warranted, or defeasibly follow from the program. t-DeLP, though, slightly differs from DeLP in order to accommodate temporal aspects, like the persistence of facts. The output of a t-DeLP program is a set of warranted literals, which is first shown to be non-contradictory and be closed under sub-arguments. This basic framework is then modified to deal with programs whose strict rules encode mutex constraints. The resulting framework is shown to satisfy stronger logical properties like indirect consistency and closure.

In this paper, we study a dialogue-based approach to multi-agent collaborative plan search in the framework of t-DeLP, an extension of DeLP for defeasible temporal reasoning. In t-DeLP programs, temporal facts and defeasible temporal rules combine into arguments, which compare against each other to decide which of their conclusions are to prevail. A backward centralized planning system built on this logical argumentative framework has been already studied in a previous work. In this paper, we consider a distributed collaborative scenario where agents exchange information using suitable dialogues. Agents cooperate to generate arguments and actions (plan steps), and to detect argument threats to plans. We show that the soundness and completeness properties of centralized t-DeLP plan search are preserved. © 2013 Springer-Verlag.

In this contribution, we study a system for argumentation- based backward planning built on t-DeLP, a temporal extension of Garcia and Simari's argumentation system known as defeasible logic programming framework (DeLP). In t-DeLP programs, temporal facts and defeasible temporal rules combine into arguments, which compare against each other to decide which of their conclusions are to prevail. We present a planning system by introducing actions (as in temporal planning) into this logical framework, and then study centralized algorithms for backward planning in scenarios involving multiple executing agents.

We slightly improve on characterization results already in the literature for base revision. We show that consistency-based partial meet revision operators can be axiomatized for any sentential logic S satisfying finitarity and monotonicity conditions (neither the deduction theorem nor supraclassicality are required to hold in S ). A characterization of limiting cases of revision operators, full meet and maxichoice, is also offered. In the second part of the paper, as a particular case, we focus on the class of graded fuzzy logics and distinguish two types of bases, naturally arising in that context, exhibiting different behavior.