1,854 research outputs found
Health risks of irrigation with untreated urban wastewater in the southern Punjab, Pakistan
Irrigation water / Water quality / Water reuse / Waste waters / Risks / Public health / Diseases / Farmers / Pakistan / Southern Punjab / Haroonabad
Epistemic Quantified Boolean Logic
This paper is aimed as a contribution to the use of formal modal languages in Artificial Intelligence. We introduce a multi-modal version of Second-order Propositional Modal Logic (SOPML), an extension of modal logic with propositional quantification, and illustrate its usefulness as a specification language for knowledge representation as well as temporal and spatial reasoning. Then, we define novel notions of (bi)simulation and prove that these preserve the interpretation of SOPML formulas. Finally, we apply these results to assess the expressive power of SOPML
A Semantical Analysis of Second-Order Propositional Modal Logic
International audienceThis paper is aimed as a contribution to the use of formal modal languages in Artificial Intelligence. We introduce a multi-modal version of Second-order Propositional Modal Logic (SOPML), an extension of modal logic with propositional quantification, and illustrate its usefulness as a specification language for knowledge representation as well as temporal and spatial reasoning. Then, we define novel notions of (bi)simulation and prove that these preserve the interpretation of SOPML formulas. Finally, we apply these results to assess the expressive power of SOPML
The undecidability of arbitrary arrow update logic
Arbitrary Arrow Update Logic is a dynamic modal logic with a modality to quantify over arrow updates. Some properties of this logic have already been established, but until now it remained an open question whether the logic's satisfiability problem is decidable. Here, we show by a reduction of the tiling problem that the satisfiability problem of Arbitrary Arrow Update Logic is co-RE hard, and therefore undecidable
A deterministic discretisation-step upper bound for state estimation via Clark transformations
Copyright © 2004 Hindawi Publishing CorporationWe consider the numerical stability of discretisation schemes for continuous-time state estimation filters. The dynamical systems we consider model the indirect observation of a continuous-time Markov chain. Two candidate observation models are studied. These models are (a) the observation of the state through a Brownian motion, and (b) the observation of the state through a Poisson process. It is shown that for robust filters (via Clark's transformation), one can ensure nonnegative estimated probabilities by choosing a maximum grid step to be no greater than a given bound. The importance of this result is that one can choose an a priori grid step maximum ensuring nonnegative estimated probabilities. In contrast, no such upper bound is available for the standard approximation schemes. Further, this upper bound also applies to the corresponding robust smoothing scheme, in turn ensuring stability for smoothed state estimates.W. P. Malcolm, R. J. Elliott, and J. van der Hoe
Malaria in Sri Lanka: Current knowledge on transmission and control
Malaria / Disease vectors / Waterborne diseases / Environmental effects / Public health / Economic impact / Social impact / Sri Lanka
- …