A propositional logic is defined which in addition to propositional language contains a list of probabilistic operators of the form P ≥s (with the intended meaning ‘‘the probability is at least s’’). The axioms and rules syntactically determine that ranges of probabilities in the corresponding models are always finite. The completeness theorem is proved. It is shown that completeness cannot be generalized to arbitrary theories.

In the past 50 years nurse scheduling has received considerable attention in the research community. There are two cases regarding the nurse scheduling problem : the static and dynamic. Dynamic NSP, is often called nurse rerostering problem, which presents reconstruction or modification of the predetermined roster for the current scheduling horizon. The aim of this paper is to present new hybrid strategy for nurse NRRP problem. The proposed methodology is based on efficient cooperation between fuzzy logic, ordered weighted averaging and (...) variable neighbourhood descent search. Complete system is tested, and experimental results are based on real-world dataset obtained from the Oncology Institute of Vojvodina in Serbia. (shrink)