Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Illustrated key to the genera of free-living marine nematodes of the Order Enoplida

A pictorial key to US genera of free-living marine nematodes in the order Enoplida is presented. Specific morphological and anatomical features are iUustrated to facilitate use of the key. The purpose of this work is to provide a single key to the genera of enoplid nematodes to facilitate identification of these organisms by nematologists and marine biologists working with meiofauna. (PDF file contains 32 pages.)

Detection of Atomic Scale Changes in the Free Volume Void Size of Three-Dimensional Colorectal Cancer Cell Culture Using Positron Annihilation Lifetime Spectroscopy

5 p.

Metal-Free Polymethyl Methacrylate (PMMA) Nanoparticles by Enamine "Click" Chemistry at Room Temperature

"Click" chemistry has become an efficient avenue to unimolecular polymeric nanoparticles through the self-crosslinking of individual polymer chains containing appropriate functional groups. Herein we report the synthesis of ultra-small (7 nm in size) polymethyl methacrylate (PMMA) nanoparticles (NPs) by the "metal-free" cross-linking of PMMA-precursor chains prepared by reversible addition-fragmentation chain transfer (RAFT) polymerization containing beta-ketoester functional groups. Intramolecular collapse was performed by the one-pot reaction of beta-ketoester moieties with alkyl diamines in tetrahydrofurane at r.t. (i.e., by enamine formation). The collapsing process was followed by size exclusion chromatography and by nuclear magnetic resonance spectroscopy. The size of the resulting PMMA-NPs was determined by dynamic light scattering. Enamine "click" chemistry increases the synthetic toolbox for the efficient synthesis of metal-free, ultra-small polymeric NPs.

Novel Papillomaviruses in Free-Ranging Iberian Bats: No Virus-Host Co-evolution, No Strict Host Specificity, and Hints for Recombination

Papillomaviruses (PVs) are widespread pathogens. However, the extent of PV infections in bats remains largely unknown. This work represents the first comprehensive study of PVs in Iberian bats. We identified four novel PVs in the mucosa of free-ranging Eptesicus serotinus (EserPV1, EserPV2, and EserPV3) and Rhinolophus ferrumequinum (RferPV1) individuals and analyzed their phylogenetic relationships within the viral family. We further assessed their prevalence in different populations of E. serotinus and its close relative E. isabellinus. Although it is frequent to read that PVs co-evolve with their host, that PVs are highly species-specific, and that PVs do not usually recombine, our results suggest otherwise. First, strict virus-host co-evolution is rejected by the existence of five, distantly related bat PV lineages and by the lack of congruence between bats and bat PVs phylogenies. Second, the ability of EserPV2 and EserPV3 to infect two different bat species (E. serotinus and E. isabellinus) argues against strict host specificity. Finally, the description of a second noncoding region in the RferPV1 genome reinforces the view of an increased susceptibility to recombination in the E2-L2 genomic region. These findings prompt the question of whether the prevailing paradigms regarding PVs evolution should be reconsidered.

Chemosensory response of marine flagellate towards L- and D- dissolved free amino acids generated during heavy grazing on bacteria

This study investigated the generation of dissolved free amino acids (DFAA) by the bacterivorous flagellate Rhynchomonas nasuta when feeding on abundant prey. Specifically, it examined whether this flagellate protist exhibits a chemosensory response towards those amino acids. The concentrations of glycine and the and D-enantiomers of glutamate, serine, threonine, alanine, and leucine were determined in co-cultures of the flagellate and bacteria. Glycine, L- and D-alanine, and L-serine were found to accumulate under these conditions in amounts that correlated positively with flagellate abundance, suggesting that protists are involved in their generation. Investigations of the chemotactic response of young and old foraging protists to the same amino acids, offered in concentrations similar to those previously generated, showed that glycine elicited the strongest attraction in both age groups. Young protists were strongly attracted to all the assayed amino acids, whereas older protists maintained a high level of attraction only for glycine. These results suggest that glycine generated by protists actively grazing in bacterially enriched patches functions as an infochemical, signaling to foraging protists the presence of available prey in the aquatic environment.

Performance analysis of bit error rate for free space optical communication with tip-tilt compensation based on gamma-gamma distribution

In this paper, the gamma-gamma probability distribution is used to model turbulent channels. The bit error rate (BER) performance of free space optical (FSO) communication systems employing on-off keying (OOK) or subcarrier binary phase-shift keying (BPSK) modulation format is derived. A tip-tilt adaptive optics system is also incorporated with a FSO system using the above modulation formats. The tip-tilt compensation can alleviate effects of atmospheric turbulence and thereby improve the BER performance. The improvement is different for different turbulence strengths and modulation formats. In addition, the BER performance of communication systems employing subcarrier BPSK modulation is much better than that of compatible systems employing OOK modulation with or without tip-tilt compensation.

Relating thermodynamics to information theory : the equality of free energy and mutual information

In this thesis we uncover a new relation which links thermodynamics and information theory. We consider time as a channel and the detailed state of a physical system as a message. As the system evolves with time, ever present noise insures that the "message" is corrupted. Thermodynamic free energy measures the approach of the system toward equilibrium. Information theoretical mutual information measures the loss of memory of initial state. We regard the free energy and the mutual information as operators which map probability distributions over state space to real numbers. In the limit of long times, we show how the free energy operator and the mutual information operator asymptotically attain a very simple relationship to one another. This relationship is founded on the common appearance of entropy in the two operators and on an identity between internal energy and conditional entropy. The use of conditional entropy is what distinguishes our approach from previous efforts to relate thermodynamics and information theory.