An automatic translation scheme from CLP to AKL

The Andorra Kernel language scheme was aimed, in principle, at simultaneously supporting the programming styles of Prolog and committed choice languages. Within the constraint programming paradigm, this family of languages could also in principle support the concurrent constraint paradigm. This happens for the Agents Kernel Language (AKL). On the other hand, AKL requires a somewhat detailed specification of control by the user. This could be avoided by programming in CLP to run on AKL. However, CLP programs cannot be executed directly on AKL. This is due to a number of factors, from more or less trivial syntactic differences to more involved issues such as the treatment of cut and making the exploitation of certain types of parallelism possible. This paper provides a translation scheme which is a basis of an automatic compiler of CLP programs into AKL, which can bridge those differences. In addition to supporting CLP, our style of translation achieves independent and-parallel execution where possible, which is relevant since this type of parallel execution preserves, through the translation, the user-perceived "complexity" of the original program.

Automatic compile-time parallelization of CLP programs by analysis and transformation to a concurrent constraint language.

The concept of independence has been recently generalized to the constraint logic programming (CLP) paradigm. Also, several abstract domains specifically designed for CLP languages, and whose information can be used to detect the generalized independence conditions, have been recently defined. As a result we are now in a position where automatic parallelization of CLP programs is feasible. In this paper we study the task of automatically parallelizing CLP programs based on such analyses, by transforming them to explicitly concurrent programs in our parallel CC platform (CIAO) as well as to AKL. We describe the analysis and transformation process, and study its efficiency, accuracy, and effectiveness in program parallelization. The information gathered by the analyzers is evaluated not only in terms of its accuracy, i.e. its ability to determine the actual dependencies among the program variables, but also of its effectiveness, measured in terms of code reduction in the resulting parallelized programs. Given that only a few abstract domains have been already defined for CLP, and that none of them were specifically designed for dependency detection, the aim of the evaluation is not only to asses the effectiveness of the available domains, but also to study what additional information it would be desirable to infer, and what domains would be appropriate for further improving the parallelization process.

The Ciao clp(FD) library. A modular CLP extension for Prolog

We present a new free library for Constraint Logic Programming over Finite Domains, included with the Ciao Prolog system. The library is entirely written in Prolog, leveraging on Ciao's module system and code transformation capabilities in order to achieve a highly modular design without compromising performance. We describe the interface, implementation, and design rationale of each modular component. The library meets several design goals: a high level of modularity, allowing the individual components to be replaced by different versions; highefficiency, being competitive with other TT> implementations; a glass-box approach, so the user can specify new constraints at different levels; and a Prolog implementation, in order to ease the integration with Ciao's code analysis components. The core is built upon two small libraries which implement integer ranges and closures. On top of that, a finite domain variable datatype is defined, taking care of constraint reexecution depending on range changes. These three libraries form what we call the TT> kernel of the library. This TT> kernel is used in turn to implement several higher-level finite domain constraints, specified using indexicals. Together with a labeling module this layer forms what we name the TT> solver. A final level integrates the CLP (J7©) paradigm with our TT> solver. This is achieved using attributed variables and a compiler from the CLP (J7©) language to the set of constraints provided by the solver. It should be noted that the user of the library is encouraged to work in any of those levels as seen convenient: from writing a new range module to enriching the set of TT> constraints by writing new indexicals.

A general implementation framework for tabled CLP

This paper describes a framework to combine tabling evalua- tion and constraint logic programming (TCLP). While this combination has been studied previously from a theoretical point of view and some implementations exist, they either suffer from a lack of efficiency, flex- ibility, or generality, or have inherent limitations with respect to the programs they can execute to completion (either with success or fail- ure). Our framework addresses these issues directly, including the ability to check for answer / call entailment, which allows it to terminate in more cases than other approaches. The proposed framework is experimentally compared with existing solutions in order to provide evidence of the mentioned advantages.

Design and implementation of a modular interface to integrate CLP and tabled execution

Logic programming (LP) is a family of high-level programming languages which provides high expressive power. With LP, the programmer writes the properties of the result and / or executable specifications instead of detailed computation steps. Logic programming systems which feature tabled execution and constraint logic programming have been shown to increase the declarativeness and efficiency of Prolog, while at the same time making it possible to write very expressive programs. Tabled execution avoids infinite failure in some cases, while improving efficiency in programs which repeat computations. CLP reduces the search tree and brings the power of solving (in)equations over arbitrary domains. Similarly to the LP case, CLP systems can also benefit from the power of tabling. Previous implementations which take ful advantage of the ideas behind tabling (e.g., forcing suspension, answer subsumption, etc. wherever it is necessary to avoid recomputation and terminate whenever possible) did not offer a simple, well-documented, easy-to-understand interface. This would be necessary to make the integratation of arbitrary CLP solvers into existing tabling systems possible. This clearly hinders a more widespread usage of the combination of both facilities. In this thesis we examine the requirements that a constraint solver must fulfill in order to be interfaced with a tabling system. We propose and implement a framework, which we have called Mod TCLP, with a minimal set of operations (e.g., entailment checking and projection) which the constraint solver has to provide to the tabling engine. We validate the design of Mod TCLP by a series of use cases: we re-engineer a previously existing tabled constrain domain (difference constraints) which was connected in an ad-hoc manner with the tabling engine in Ciao Prolog; we integrateHolzbauer’s CLP(Q) implementationwith Ciao Prolog’s tabling engine; and we implement a constraint solver over (finite) lattices. We evaluate its performance with several benchmarks that implement a simple abstract interpreter whose fixpoint is reached by means of tabled execution, and whose domain operations are handled by the constraint over (finite) lattices, where TCLP avoids recomputing subsumed abstractions.---ABSTRACT---La programación lógica con restricciones (CLP) y la tabulación son extensiones de la programación lógica que incrementan la declaratividad y eficiencia de Prolog, al mismo tiempo que hacen posible escribir programasmás expresivos. Las implementaciones anteriores que integran completamente ambas extensiones, incluyendo la suspensión de la ejecución de objetivos siempre que sea necesario, la implementación de inclusión (subsumption) de respuestas, etc., en todos los puntos en los que sea necesario para evitar recomputaciones y garantizar la terminación cuando sea posible, no han proporcionan una interfaz simple, bien documentada y fácil de entender. Esta interfaz es necesaria para permitir integrar resolutores de CLP arbitrarios en el sistema de tabulación. Esto claramente dificulta un uso más generalizado de la integración de ambas extensiones. En esta tesis examinamos los requisitos que un resolutor de restricciones debe cumplir para ser integrado con un sistema de tabulación. Proponemos un esquema (y su implementación), que hemos llamadoMod TCLP, que requiere un reducido conjunto de operaciones (en particular, y entre otras, entailment y proyección de almacenes de restricciones) que el resolutor de restricciones debe ofrecer al sistema de tabulación. Hemos validado el diseño de Mod TCLP con una serie de casos de uso: la refactorización de un sistema de restricciones (difference constraints) previamente conectado de un modo ad-hoc con la tabulación de Ciao Prolog; la integración del sistema de restricciones CLP(Q) de Holzbauer; y la implementación de un resolutor de restricciones sobre retículos finitos. Hemos evaluado su rendimiento con varios programas de prueba, incluyendo la implementación de un intérprete abstracto que alcanza su punto fijo mediante el sistema de tabulación y en el que las operaciones en el dominio son realizadas por el resolutor de restricciones sobre retículos (finitos) donde TCLP evita la recomputación de valores abstractos de las variables ya contenidos en llamadas anteriores.

Coordination of protein and mRNA abundances of stromal enzymes and mRNA abundances of the Clp protease subunits during senescence of Phaseolus vulgaris (L.) leaves

Our objective was to determine the coordination of transcript and/or protein abundances of stromal enzymes during leaf senescence. First trifolioliate leaves of Phaseolus vulgaris L. plants were sampled beginning at the time of full leaf expansion; at this same time, half of the plants were switched to a nutrient solution lacking N. Total RNA and soluble protein abundances decreased after full leaf expansion whereas chlorophyll abundance remained constant; N stress enhanced the decline in these traits. Abundances of ribulose-1,5-bisposphate carboxylase/oxygenase (Rubisco; EC 4.1.1.39), Rubisco activase and phosphoribulokinase (Ru5P kinase; EC 2.7.1.19) decreased after full leaf expansion in a coordinated manner for both treatments. In contrast, adenosine diphosphate glucose (ADPGlc) pyrophosphorylase (EC 2.7.7.27) abundance was relatively constant during natural senescence but did decline similar to the other enzymes under N stress. Northern analyses indicated that transcript abundances for all enzymes declined markedly on a fresh-weight basis just after full leaf expansion. This rapid decline was particularly strong for the Rubisco small subunit (rbcS) transcript. The decline was enhanced by N stress for rbcS and Rubisco activase (rca), but not for Ru5P kinase (prk) and ADPGlc pyrophosphorylase (agp). Transcripts of the Clp protease subunits clpC and clpP declined in abundance just after full leaf expansion, similar to the other mRNA species. When Northern blots were analyzed using equal RNA loads, rbcS transcripts still declined markedly just after full leaf expansion whereas rca and clpC transcripts increased over time. The results indicated that senescence was initiated near the time of full leaf expansion, was accelerated by N stress, and was characterized by large decline in transcripts of stromal enzymes. The decreased mRNA abundances were in general associated with steadily declining stromal protein abundances, with ADPGlc pyrophosphorylase being the notable exception. Transcript analyses for the Clp subunits supported a recent report (Shanklin et al., 1995, Plant Cell 7: 1713--1722) indicating that the Clp protease subunits were constitutive throughout development and suggested that ClpC and ClpP do not function as a senescence-specific proteolytic system in Phaseolus.

Étude comparative de la régulation transcriptionnelle des opérons foo et clp, codant respectivement pour les adhésines F165₁ et CS31A

Thèse numérisée par la Direction des bibliothèques de l'Université de Montréal.

Étude comparative de la régulation transcriptionnelle des opérons foo et clp, codant respectivement pour les adhésines F165₁ et CS31A

Thèse numérisée par la Direction des bibliothèques de l'Université de Montréal.

Extending the 2P-Kt ecosystem: CLP and Labelled LP

The ability to create hybrid systems that blend different paradigms has now become a requirement for complex AI systems usually made of more than a component. In this way, it is possible to exploit the advantages of each paradigm and exploit the potential of different approaches such as symbolic and non-symbolic approaches. In particular, symbolic approaches are often exploited for their efficiency, effectiveness and ability to manage large amounts of data, while symbolic approaches are exploited to ensure aspects related to explainability, fairness, and trustworthiness in general. The thesis lies in this context, in particular in the design and development of symbolic technologies that can be easily integrated and interoperable with other AI technologies. 2P-Kt is a symbolic ecosystem developed for this purpose, it provides a logic-programming (LP) engine which can be easily extended and customized to deal with specific needs. The aim of this thesis is to extend 2P-Kt to support constraint logic programming (CLP) as one of the main paradigms for solving highly combinatorial problems given a declarative problem description and a general constraint-propagation engine. A real case study concerning school timetabling is described to show a practical usage of the CLP(FD) library implemented. Since CLP represents only a particular scenario for extending LP to domain-specific scenarios, in this thesis we present also a more general framework: Labelled Prolog, extending LP with labelled terms and in particular labelled variables. The designed framework shows how it is possible to frame all variations and extensions of LP under a single language reducing the huge amount of existing languages and libraries and focusing more on how to manage different domain needs using labels which can be associated with every kind of term. Mapping of CLP into Labeled Prolog is also discussed as well as the benefits of the provided approach.

Avaliação audiológica pré-cirurgia otológica de indivíduos com fissura labiopalatina operada

OBJETIVO: descrever as características audiológicas de indivíduos com fissura labiopalatina operada (FLP) e indicação de cirurgia otológica, comparando os grupos quanto ao tipo e grau da perda auditiva, bem como a curva timpanométrica. MÉTODOS: análise de 150 prontuários, ambos os gêneros, idade igual ou superior a 4 anos, FLP e indicação de cirurgia otológica, divididos em 3 grupos: I - Tubo de ventilação (TV), II - Timpanoplastia e III - Timpanomastoidectomia, analisando aspectos quanto a entrevista audiológica, audiometria tonal limiar e imitanciometria. RESULTADOS: o grupo I apresentou porcentagem maior de cirurgia bilateral (86%), o que não ocorreu nos demais grupos. Na entrevista audiológica, 83% apresentou algum tipo de queixa auditiva, sendo a mais frequente a perda auditiva (64%) com p<0,05 entre os grupos I e II; I e III. O tipo de perda auditiva de maior ocorrência foi condutivo bilateral (56%) seguido de unilateral (35%), com p<0,05 entre os grupos I e II; I e III. A perda de grau leve unilateral foi a de maior ocorrência (41%), seguida de grau leve a moderada bilateral (20%), com p<0,05 entre os três grupos. A curva timpanométrica mais frequente foi a do tipo B bilateral (39%) com p<0,05 entre os três grupos. CONCLUSÃO: a maioria dos indivíduos apresentou algum tipo de queixa na entrevista audiológica e alterações na audiometria tonal limiar e imitanciometria. A maioria dessas alterações foi compatível com problemas de orelha média, com perda auditiva do tipo condutiva, de grau leve e bilateral, independentemente da indicação cirúrgica.

As atividades expressivas e recreativas em crianças com fissura labiopalatina hospitalizadas: visão dos familiares

Este estudo teve por objetivo verificar a visão dos familiares a respeito da importância das atividades expressivas e recreativas na hospitalização e recuperação cirúrgica de crianças com fissura labiopalatina (FLP), procurando identificar os benefícios dessas atividades nos períodos pré e pós-operatório. Foram entrevistados 138 familiares de crianças com FLP, na faixa etária de sete a 12 anos, hospitalizados no Hospital de Reabilitação de Anomalias Craniofaciais (HRAC/USP). Os resultados mostraram que a grande maioria dos entrevistados preferia desenvolver alguma atividade com a criança enquanto aguardava a cirurgia, tendo expressado sentimentos positivos durante esse período. Segundo os entrevistados, as atividades expressivas e recreativas no período pré-operatório deixam a criança mais calma, observando melhora na condição emocional da mesma. Essas atividades distraem, divertem, acalmam e contribuem para o desenvolvimento da criança, sendo importantes para a recuperação cirúrgica, amenizando os efeitos negativos da hospitalização. As atividades na brinquedoteca foram as preferidas pelas crianças e pelos familiares. Na visão dos familiares, as atividades expressivas e recreativas favorecem a criança e os pais, reduzindo o estresse, proporcionando sentimentos positivos a ambos e auxiliando a adaptação e o restabelecimento físico e emocional. Evidenciam a importância do brincar durante a hospitalização, contribuindo para um atendimento humanizado, principalmente no caso de crianças com fissura labiopalatina, sujeitas a um grande número de procedimentos cirúrgicos e hospitalizações.

Evaluation of the effects of ozone therapy in the treatment of intra-abdominal infection in rats

INTRODUCTION: The antibacterial effect of ozone (O3) has been described in the extant literature, but the role of O3 therapy in the treatment of certain types of infection remains controversial. OBJECTIVES: To evaluate the effect of intraperitoneal (i.p.) O3 application in a cecal ligation/puncture rat model on interleukins (IL-6, IL-10) and cytokine-induced neutrophil chemoattractant (CINC)-1 serum levels, acute lung injury and survival rates. METHODS: Four animal groups were used for the study: a) the SHAM group underwent laparotomy; b) the cecal ligation/puncture group underwent cecal ligation/puncture procedures; and c) the CLP+O2 and CLP+O3 groups underwent CLP+ corresponding gas mixture infusions (i.p.) throughout the observation period. IL-6, CINC-1 and IL-10 concentrations were determined by enzyme-linked immunosorbent assay (ELISA). Acute lung injury was evaluated with the Evans blue dye lung leakage method and by lung histology. P<0.05 was considered significant. RESULTS: CINC-1 was at the lowest level in the SHAM group and was lower for the CLP+O3 group vs. the CLP+O2 group and the cecal ligation/puncture group. IL-10 was lower for the SHAM group vs. the other three groups, which were similar compared to each other. IL-6 was lower for the SHAM group vs. all other groups, was lower for the CLP+O3 or CLP+O2 group vs. the cecal ligation/puncture group, and was similar for the CLP+O3 group vs. the CLP+O2 group. The lung histology score was lower for the SHAM group vs. the other groups. The Evans blue dye result was lower for the CLP+O3 group vs. the CLP+O2 group and the cecal ligation/puncture group but similar to that of the SHAM group. The survival rate for the CLP+O3 group was lower than for the SHAM group and similar to that for the other 2 groups (CLP and CLP+O2). CONCLUSION: Ozone therapy modulated the inflammatory response and acute lung injury in the cecal ligation/puncture infection model in rats, although there was no improvement on survival rates.

Immune cells and oxidative stress in the endotoxin tolerance mouse model

Sepsis is a systemic inflammatory response that can lead to tissue damage and death. In order to increase our understanding of sepsis, experimental models are needed that produce relevant immune and inflammatory responses during a septic event. We describe a lipopolysaccharide tolerance mouse model to characterize the cellular and molecular alterations of immune cells during sepsis. The model presents a typical lipopolysaccharide tolerance pattern in which tolerance is related to decreased production and secretion of cytokines after a subsequent exposure to a lethal dose of lipopolysaccharide. The initial lipopolysaccharide exposure also altered the expression patterns of cytokines and was followed by an 8- and a 1.5-fold increase in the T helper 1 and 2 cell subpopulations. Behavioral data indicate a decrease in spontaneous activity and an increase in body temperature following exposure to lipopolysaccharide. In contrast, tolerant animals maintained production of reactive oxygen species and nitric oxide when terminally challenged by cecal ligation and puncture (CLP). Survival study after CLP showed protection in tolerant compared to naive animals. Spleen mass increased in tolerant animals followed by increases of B lymphocytes and subpopulation Th1 cells. An increase in the number of stem cells was found in spleen and bone marrow. We also showed that administration of spleen or bone marrow cells from tolerant to naive animals transfers the acquired resistance status. In conclusion, lipopolysaccharide tolerance is a natural reprogramming of the immune system that increases the number of immune cells, particularly T helper 1 cells, and does not reduce oxidative stress.

The effect of laparoscopy access and antibiotics on the outcome of severe bacterial peritonitis in rats

Introduction: Treatment of severe bacterial peritonitis, especially by videolaparoscopy, is still a matter of investigation. The aim of the present study was to evaluate the effect of videolaparoscopy and laparotomy access with or without antibiotics on the outcome of severe bacterial peritonitis in rats. Materials and Methods: Sixty-four male Wistar rats were equally assigned to 8 groups: Sham surgery (SHAM), SHAM+antibiotics (SHAM+AB), cecal ligation and puncture (CLP), CLP+AB, CLP+videolaparoscopy (VLAP), CLP+laparotomy (LAP), VLAP+AB, and LAP+AB. All treated animals were submitted to an evaluation of bacteremia, white cell counts, and cytokine determinations: interleukin (IL)-1, IL-6, and tumor necrosis factor-alpha (TNF-alpha). The groups treated with antibiotics received gentamicin and metronidazole. Survival was monitored over a period of 7 days. Results: Peritonitis induced by CLP was severe, with IL-1, IL-6, and TNF-alpha levels and lethality being significantly higher compared to the SHAM group. The IL-6 levels in the VLAP group were significantly higher compared to the CLP and VLAP+AB groups, and the TNF-alpha levels in the VLAP and LAP+AB groups were significantly higher compared to the LAP group. The survival time was significantly higher in the CLP+AB and VLAP+AB groups, when compared to the CLP group. There was no significant difference in bacteremia and lethality rates between the resources employed for treatment of peritonitis. Conclusions: Although the use of laparoscopic access itself exacerbates the inflammatory response, the combination with antibiotics minimizes this effect and increases the survival time. However, all of the resources used for treating severe peritonitis, when applied alone or in combination, have an equivalent influence on bacteremia and lethality rates.