Zonal playfield attributes – A stochastic approach to subjective passing affordances in football

Introduction: According to the ecological view, coordination establishes byvirtueof social context. Affordances thought of as situational opportunities to interact are assumed to represent the guiding principles underlying decisions involved in interpersonal coordination. It’s generally agreed that affordances are not an objective part of the (social) environment but that they depend on the constructive perception of involved subjects. Theory and empirical data hold that cognitive operations enabling domain-specific efficacy beliefs are involved in the perception of affordances. The aim of the present study was to test the effects of these cognitive concepts in the subjective construction of local affordances and their influence on decision making in football. Methods: 71 football players (M = 24.3 years, SD = 3.3, 21 % women) from different divisions participated in the study. Participants were presented scenarios of offensive game situations. They were asked to take the perspective of the person on the ball and to indicate where they would pass the ball from within each situation. The participants stated their decisions in two conditions with different game score (1:0 vs. 0:1). The playing fields of all scenarios were then divided into ten zones. For each zone, participants were asked to rate their confidence in being able to pass the ball there (self-efficacy), the likelihood of the group staying in ball possession if the ball were passed into the zone (group-efficacy I), the likelihood of the ball being covered safely by a team member (pass control / group-efficacy II), and whether a pass would establish a better initial position to attack the opponents’ goal (offensive convenience). Answers were reported on visual analog scales ranging from 1 to 10. Data were analyzed specifying general linear models for binomially distributed data (Mplus). Maximum likelihood with non-normality robust standard errors was chosen to estimate parameters. Results: Analyses showed that zone- and domain-specific efficacy beliefs significantly affected passing decisions. Because of collinearity with self-efficacy and group-efficacy I, group-efficacy II was excluded from the models to ease interpretation of the results. Generally, zones with high values in the subjective ratings had a higher probability to be chosen as passing destination (βself-efficacy = 0.133, p < .001, OR = 1.142; βgroup-efficacy I = 0.128, p < .001, OR = 1.137; βoffensive convenience = 0.057, p < .01, OR = 1.059). There were, however, characteristic differences in the two score conditions. While group-efficacy I was the only significant predictor in condition 1 (βgroup-efficacy I = 0.379, p < .001), only self-efficacy and offensive convenience contributed to passing decisions in condition 2 (βself-efficacy = 0.135, p < .01; βoffensive convenience = 0.120, p < .001). Discussion: The results indicate that subjectively distinct attributes projected to playfield zones affect passing decisions. The study proposes a probabilistic alternative to Lewin’s (1951) hodological and deterministic field theory and enables insight into how dimensions of the psychological landscape afford passing behavior. Being part of a team, this psychological landscape is not only constituted by probabilities that refer to the potential and consequences of individual behavior, but also to that of the group system of which individuals are part of. Hence, in regulating action decisions in group settings, informers are extended to aspects referring to the group-level. References: Lewin, K. (1951). In D. Cartwright (Ed.), Field theory in social sciences: Selected theoretical papers by Kurt Lewin. New York: Harper & Brothers.

An Economic Theory of Mortgage Redemption Laws

Redemption laws give mortgagors the right to redeem their property following default for a statutorily set period of time. This paper develops a theory that explains these laws as a means of protecting landowners against the loss of nontransferable values associated with their land. A longer redemption period reduces the risk that this value will be lost but also increases the likelihood of default. The optimal redemption period balances these effects. Empirical analysis of cross-state data from the early twentieth century suggests that these factors, in combination with political considerations, explain the existence and length of redemption laws.

Evaluation of the causal pathways through which subjective norms influence mammography intention and stage of change in a national sample of women veterans

Few studies have investigated causal pathways linking psychosocial factors to each other and to screening mammography. Conflicting hypotheses exist in the theoretic literature regarding the role and importance of subjective norms, a person's perceived social pressure to perform the behavior and his/her motivation to comply. The Theory of Reasoned Action (TRA) hypothesizes that subjective norms directly affect intention; while the Transtheoretical Model (TTM) hypothesizes that attitudes mediate the influence of subjective norms on stage of change. No one has examined which hypothesis best predicts the effect of subjective norms on mammography intention and stage of change. Two statistical methods are available for testing mediation, sequential regression analysis (SRA) and latent variable structural equation modeling (LVSEM); however, software to apply LVSEM to dichotomous variables like intention has only recently become available. No one has compared the methods to determine whether or not they yield similar results for dichotomous variables. ^ Study objectives were to: (1) determine whether the effect of subjective norms on mammography intention and stage of change are mediated by pros and cons; and (2) compare mediation results from the SRA and LVSEM approaches when the outcome is dichotomous. We conducted a secondary analysis of data from a national sample of women veterans enrolled in Project H.O.M.E. (H&barbelow;ealthy O&barbelow;utlook on the M&barbelow;ammography E&barbelow;xperience), a behavioral intervention trial. ^ Results showed that the TTM model described the causal pathways better than the TRA one; however, we found support for only one of the TTM causal mechanisms. Cons was the sole mediator. The mediated effect of subjective norms on intention and stage of change by cons was very small. These findings suggest that interventionists focus their efforts on reducing negative attitudes toward mammography when resources are limited. ^ Both the SRA and LVSEM methods provided evidence for complete mediation, and the direction, magnitude, and standard errors of the parameter estimates were very similar. Because SRA parameter estimates were not biased toward the null, we can probably assume negligible measurement error in the independent and mediator variables. Simulation studies are needed to further our understanding of how these two methods perform under different data conditions. ^

Criteria of election of postgraduate courses in graduated students of technological/ humanistic/ artistic professions : Subjective and contextual involvements to arrive at the conclusion of them

El aumento en la cantidad de estudios de posgrado y de sus cursantes derivados de la demanda por mayores credenciales académicas en lo laboral y por la búsqueda personal para especializarse profesionalmente, es un fenómeno observado en Argentina desde mediados de los años 90. Obtener el título final de estos estudios resulta un porcentaje muy inferior en relación al número de sus inscriptos. Tales motivos focalizaron nuestra atención para analizar tanto los criterios de elección del posgrado como las condiciones contextuales y subjetivas para alcanzar la titulación. Este estudio, de tipo cualitativo, investiga en tres carreras de Especialización que se cursan en diferentes Universidades nacionales , los aspectos de su organización y estilo propuesto para cursar y lograr la finalización de los estudios, así como las motivaciones de la elección de cursantes y egresados en tres ramas diferentes: artística, humanística y tecnológica. El conocimiento sobre la lógica de la organización y la particularidad del objeto de estudio de cada carrera permite analizar diferencias y semejanzas entre ellas aportando algunas propuestas para considerar en programas de formación; mientras que los trayectos de cursantes y egresados explican aspectos subjetivos que intervienen en la finalización o no del posgrado.

El Test de Ramsey y las lógicas condicionales

Frank Ramsey (1931) estableció ciertas condiciones que deberían cumplirse a fin de evaluar las proposiciones condicionales, conocidas hoy como Test de Ramsey (TR) En este trabajo se muestra que las teorías sobre condicionales contrafácticos de Chisholmj, Stalnaker y D. Lewis, satisfacen el TR y la incompatibilidad de TR con la Teoría de la revisión de creencias (AGM). En la última sección se analiza el comportamiento del TR en la propuesta de G. Grocco y L. Fariñas del Cerro, basada en una generalización del cálculo de Secuentes pero introduciendo la novedad de secuencias auxiliares cuya noción de consecuencia es no-monótona.

El Test de Ramsey y las lógicas condicionales

Frank Ramsey (1931) estableció ciertas condiciones que deberían cumplirse a fin de evaluar las proposiciones condicionales, conocidas hoy como Test de Ramsey (TR) En este trabajo se muestra que las teorías sobre condicionales contrafácticos de Chisholmj, Stalnaker y D. Lewis, satisfacen el TR y la incompatibilidad de TR con la Teoría de la revisión de creencias (AGM). En la última sección se analiza el comportamiento del TR en la propuesta de G. Grocco y L. Fariñas del Cerro, basada en una generalización del cálculo de Secuentes pero introduciendo la novedad de secuencias auxiliares cuya noción de consecuencia es no-monótona.

Criteria of election of postgraduate courses in graduated students of technological/ humanistic/ artistic professions : Subjective and contextual involvements to arrive at the conclusion of them

El aumento en la cantidad de estudios de posgrado y de sus cursantes derivados de la demanda por mayores credenciales académicas en lo laboral y por la búsqueda personal para especializarse profesionalmente, es un fenómeno observado en Argentina desde mediados de los años 90. Obtener el título final de estos estudios resulta un porcentaje muy inferior en relación al número de sus inscriptos. Tales motivos focalizaron nuestra atención para analizar tanto los criterios de elección del posgrado como las condiciones contextuales y subjetivas para alcanzar la titulación. Este estudio, de tipo cualitativo, investiga en tres carreras de Especialización que se cursan en diferentes Universidades nacionales , los aspectos de su organización y estilo propuesto para cursar y lograr la finalización de los estudios, así como las motivaciones de la elección de cursantes y egresados en tres ramas diferentes: artística, humanística y tecnológica. El conocimiento sobre la lógica de la organización y la particularidad del objeto de estudio de cada carrera permite analizar diferencias y semejanzas entre ellas aportando algunas propuestas para considerar en programas de formación; mientras que los trayectos de cursantes y egresados explican aspectos subjetivos que intervienen en la finalización o no del posgrado.

Criteria of election of postgraduate courses in graduated students of technological/ humanistic/ artistic professions : Subjective and contextual involvements to arrive at the conclusion of them

El aumento en la cantidad de estudios de posgrado y de sus cursantes derivados de la demanda por mayores credenciales académicas en lo laboral y por la búsqueda personal para especializarse profesionalmente, es un fenómeno observado en Argentina desde mediados de los años 90. Obtener el título final de estos estudios resulta un porcentaje muy inferior en relación al número de sus inscriptos. Tales motivos focalizaron nuestra atención para analizar tanto los criterios de elección del posgrado como las condiciones contextuales y subjetivas para alcanzar la titulación. Este estudio, de tipo cualitativo, investiga en tres carreras de Especialización que se cursan en diferentes Universidades nacionales , los aspectos de su organización y estilo propuesto para cursar y lograr la finalización de los estudios, así como las motivaciones de la elección de cursantes y egresados en tres ramas diferentes: artística, humanística y tecnológica. El conocimiento sobre la lógica de la organización y la particularidad del objeto de estudio de cada carrera permite analizar diferencias y semejanzas entre ellas aportando algunas propuestas para considerar en programas de formación; mientras que los trayectos de cursantes y egresados explican aspectos subjetivos que intervienen en la finalización o no del posgrado.

El Test de Ramsey y las lógicas condicionales

Frank Ramsey (1931) estableció ciertas condiciones que deberían cumplirse a fin de evaluar las proposiciones condicionales, conocidas hoy como Test de Ramsey (TR) En este trabajo se muestra que las teorías sobre condicionales contrafácticos de Chisholmj, Stalnaker y D. Lewis, satisfacen el TR y la incompatibilidad de TR con la Teoría de la revisión de creencias (AGM). En la última sección se analiza el comportamiento del TR en la propuesta de G. Grocco y L. Fariñas del Cerro, basada en una generalización del cálculo de Secuentes pero introduciendo la novedad de secuencias auxiliares cuya noción de consecuencia es no-monótona.

A Mathematical Representation of "Excitement" in Games: A Contribution to the Theory of Game Systems

Researchers have long believed the concept of "excitement" in games to be subjective and difficult to measure. This paper presents the development of a mathematically computable index that measures the concept from the viewpoint of an audience and from that of a player. One of the key aspects of the index is the differential of the probability of "winning" before and after one specific "play" in a given game. The index makes a large contribution to the study of games and enables researchers to compare and analyze the “excitement” of various games. It may be applied in many fields, especially the area of welfare economics, and applications may range from those related to allocative efficiency to axioms of justice and equity.

Uniformly Reweighted Belief Propagation: A Factor Graph Approach

Tree-reweighted belief propagation is a message passing method that has certain advantages compared to traditional belief propagation (BP). However, it fails to outperform BP in a consistent manner, does not lend itself well to distributed implementation, and has not been applied to distributions with higher-order interactions. We propose a method called uniformly-reweighted belief propagation that mitigates these drawbacks. After having shown in previous works that this method can substantially outperform BP in distributed inference with pairwise interaction models, in this paper we extend it to higher-order interactions and apply it to LDPC decoding, leading performance gains over BP.

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.

Hiord: A type-free higher-order logic programming language with predicate abstraction

A new formalism, called Hiord, for defining type-free higherorder logic programming languages with predicate abstraction is introduced. A model theory, based on partial combinatory algebras, is presented, with respect to which the formalism is shown sound. A programming language built on a subset of Hiord, and its implementation are discussed. A new proposal for defining modules in this framework is considered, along with several examples.

Introduction to the 26th international conference on logic programming special issue

Abstract is not available

The role of computational logic as a hinge paradigm among deduction, problem solving, programming, and parallelism

This paper presents some brief considerations on the role of Computational Logic in the construction of Artificial Intelligence systems and in programming in general. It does not address how the many problems in AI can be solved but, rather more modestly, tries to point out some advantages of Computational Logic as a tool for the AI scientist in his quest. It addresses the interaction between declarative and procedural views of programs (deduction and action), the impact of the intrinsic limitations of logic, the relationship with other apparently competing computational paradigms, and finally discusses implementation-related issues, such as the efficiency of current implementations and their capability for efficiently exploiting existing and future sequential and parallel hardware. The purpose of the discussion is in no way to present Computational Logic as the unique overall vehicle for the development of intelligent systems (in the firm belief that such a panacea is yet to be found) but rather to stress its strengths in providing reasonable solutions to several aspects of the task.