1.

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,...

2.

Implementing Logics: From Genericity to Heterogeneity
- Till Mossakowski; Klaus Lüttich
We show how to write an abstract interface corresponding to Meseguer's concept of general logic in Haskell. Based on this, we develop a tool set for structured specifications that are based on such logics, consisting of a parser, a static analysis and a theorem prover. While with Standard ML functors, it is only possible to be generic over an arbitrary logic, we show how true heterogeneity (i.e. for specification involving simultaneously different logics) is achieved in Haskell. Concerning genericity, it is folklore that Standard ML functors can be simulated in Haskell using multiparameter type classes with functional dependencies. On top...

3.

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...

4.

Classical Negation and Game-Theoretical Semantics
- Tulenheimo, Tero
Typical applications of Hintikka’s game-theoretical semantics (GTS) give rise to semantic attributes—truth, falsity—expressible in the $\Sigma^{1}_{1}$ -fragment of second-order logic. Actually a much more general notion of semantic attribute is motivated by strategic considerations. When identifying such a generalization, the notion of classical negation plays a crucial role. We study two languages, $L_{1}$ and $L_{2}$ , in both of which two negation signs are available: $\rightharpoondown $ and $\sim$ . The latter is the usual GTS negation which transposes the players’ roles, while the former will be interpreted via the notion of mode. Logic $L_{1}$ extends independence-friendly (IF) logic; $\rightharpoondown...

5.

Foundations for decision problems in separation logic with general inductive predicates
- Antonopoulos, T; Ouaknine, J; Gorogiannis, N; Haase, C; Kanovich, M
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 Π -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. ©...

6.

Dizionario di scienze filosofiche; termini de filosofia generale, logica, psicologia, pedagogia, etica, ecc.,
- Ranzoli, Cesare,
1876-1926.
Mode of access: Internet.

7.

Globalización y construcción de conocimientos. El estado de la investigación social en América Latina.
- Massardo, Jaime
La lectura de diferentes trabajos de investigación social efectuados en América Latina a partir de la década de los 80 sugiere la existencia de una considerable mutación con respecto a los diversos paradigmas en los que se venían desarrollando en nuestro continente. Así, los marcos teóricos -explícitos o implícitos-, los sistemas de referencia conceptuales, la lógica de la aprehensión de los problemas propuestos y, en general, la metodología -en el sentido de la relación que establece el investigador con su objeto de estudio-, parecen, durante estos últimos quince años, venir cambiando considerablemente en términos de su concepción y de su...

8.

The origin and significance of Hegel's logic; a general introduction to Hegel's system.
- Baillie, J. B.
(James Black),
Sir,
1872-1940.
Mode of access: Internet.

9.

LOGICAL DYNAMICS MEETS LOGICAL PLURALISM?
- Johan van Benthem
First introduction Where is logic heading today? There is a general feeling that the discipline is broadening its scope and agenda beyond classical foundational issues, and maybe even a concern that, like Stephen Leacock’s famous horseman, it is ‘riding off madly in all directions’. So, what is the resultant vector? There seem to be two broad answers in circulation today. One is logical pluralism, locating the new scope of logic in charting a wide variety of reasoning styles, often marked by non-classical structural rules of inference. This is the new program that I subscribed to in my work on sub-structural...

10.

The information in intuitionistic logic
- Johan Van Benthem
Issues about information spring up wherever one scratches the surface of logic. Here is a case that raises delicate issues of ‘factual’ versus ‘procedural’ information, or ‘statics’ versus ‘dynamics’. What does intuitionistic logic, perhaps the earliest source of informational and procedural thinking in contemporary logic, really tell us about information? How does its view relate to its ‘cousin ’ epistemic logic? We discuss connections between intuitionistic models and recent protocol models for dynamic-epistemic logic, as well as more general issues that emerge.

11.

Specialization of Recursive Predicates from Positive Examples Only
- Moussa Demba
... semantics φ (the programmer’s intentions) where P does not satisfy φ, find out a new version P’ of P such that P’ satisfies φ. Approach: We proposed an approach for correcting overly general programs from positive examples by exploiting program synthesis techniques. The synthesized program, P’, is a specialization of the original one, P. In contrast to the previous approaches for logic program specialization, no negative examples were given as input but they will be discovered by the algorithm itself. The specialization process is performed according to the positive examples only. A method for refining logic programs into specialized...

12.

Specialization of Recursive Predicates from Positive Examples Only
- Moussa Demba
... semantics φ (the programmer’s intentions) where P does not satisfy φ, find out a new version P ’ of P such that P ’ satisfies φ. Approach: We proposed an approach for correcting overly general programs from positive examples by exploiting program synthesis techniques. The synthesized program, P’, is a specialization of the original one, P. In contrast to the previous approaches for logic program specialization, no negative examples were given as input but they will be discovered by the algorithm itself. The specialization process is performed according to the positive examples only. A method for refining logic programs...

13.

Specialization of Recursive Predicates from Positive Examples Only
- Moussa Demba
...semantics φ (the programmer’s intentions) where P does not satisfy φ, find out a new version P’ of P such that P’ satisfies φ. Approach: We proposed an approach for correcting overly general programs from positive examples by exploiting program synthesis techniques. The synthesized program, P’, is a specialization of the original one, P. In contrast to the previous approaches for logic program specialization, no negative examples were given as input but they will be discovered by the algorithm itself. The specialization process is performed according to the positive examples only. A method for refining logic programs into specialized version...

14.

Specialization of Recursive Predicates from Positive Examples Only
- Moussa Demba
... semantics φ (the programmer’s intentions) where P does not satisfy φ, find out a new version P ’ of P such that P ’ satisfies φ. Approach: We proposed an approach for correcting overly general programs from positive examples by exploiting program synthesis techniques. The synthesized program, P’, is a specialization of the original one, P. In contrast to the previous approaches for logic program specialization, no negative examples were given as input but they will be discovered by the algorithm itself. The specialization process is performed according to the positive examples only. A method for refining logic programs...

15.

Terminal Area Simulation System User's Guide - Version 10.0
- Switzer, George F.; Proctor, Fred H.
The Terminal Area Simulation System (TASS) is a three-dimensional, time-dependent, large eddy simulation model that has been developed for studies of wake vortex and weather hazards to aviation, along with other atmospheric turbulence, and cloud-scale weather phenomenology. This document describes the source code for TASS version 10.0 and provides users with needed documentation to run the model. The source code is programed in Fortran language and is formulated to take advantage of vector and efficient multi-processor scaling for execution on massively-parallel supercomputer clusters. The code contains different initialization modules allowing the study of aircraft wake vortex interaction with the atmosphere...

16.

A Proof Theory for Constructive Default Logic
- Yao-hua Tan
. We present what we call Constructive Default Logic (CDL) - a default logic in which the fixedpoint definition of extensions is replaced by a constructive definition which yield so-called constructive extensions. Selection functions are used to represent explicitly the control of the reasoning process in this default logic. It is well-known that Reiter's original default logic lacks, in general, a default proof theory. We will show that CDL does have a default proof theory, and we will also show that this is related to the fact that CDL has the existence property for constructive extensions and that it also...

17.

Using First-Order Probability Logic for the Construction of Bayesian Networks
- Fahiem Bacchus
We present a mechanism for constructing graphical models, specifically Bayesian networks, from a knowledge base of general probabilistic information. The unique feature of our approach is that it uses a powerful first-order probabilistic logic for expressing the general knowledge base. This logic allows for the representation of a wide range of logical and probabilistic information. The model construction procedure we propose uses notions from direct inference to identify pieces of local statistical information from the knowledge base that are most appropriate to the particular event we want to reason about. These pieces are composed to generate a joint probability distribution...

18.

Structural Operational Semantics for AKL
- Seif Haridi; Sverker Janson; Catuscia Palamidessi
The Andorra Kernel Language (AKL) is a concurrent constraint programming language. It can be seen as a general combination of logic programming languages such as Prolog, GHC, and Parlog, the first of which provides don't know nondeterminism, and the last two of which are concurrent logic programming languages. The constraint system is an independent parameter of the language description. In this paper, we revisit the description of Janson and Haridi [10], adding the formal machinery which is necessary in order to completely formalize the control of the computation model. To this we add a formal description of the transformational semantics...

19.

Ports for Objects in Concurrent Logic Programs
- Sverker Janson; Johan Montelius; Seif Haridi
We introduce ports, an alternative to streams, as communication support for object-oriented programming in concurrent constraint logic programming languages. From a pragmatic point of view ports provide efficient many-toone communication, object identity, means for garbage collection of objects, and opportunities for optimised compilation techniques for concurrent objects. From a semantic point of view, ports preserve the monotonicity of the constraint store which is a crucial property of all concurrent constraint languages. We also show that the Exclusive-read, Exclusive-write PRAM model of parallel computation can be realised quite faithfully using ports in terms of space and time complexity, thus allowing arbitrary...

20.

Encoding Dependent Types in an Intuitionistic Logic
- Amy Felty
Various languages have been proposed as specification languages for representing a wide variety of logics. The development of typed -calculi has been one approach toward this goal. The logical framework (LF), a -calculus with dependent types is one example of such a language. A small subset of intuitionistic logic with quantification over the 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. In this paper, we show how to translate specifications in LF...