In this paper, the concept of a granulation order is proposed in an information system. The converse approximation of a target concept under a granulation order is defined and some of its important properties are obtained, which can be used to characterize the structure of a set approximation. For a
Eliminating “converse” from converse PDL
✍ Scribed by Giuseppe Giacomo
- Publisher
- Springer Netherlands
- Year
- 1996
- Tongue
- English
- Weight
- 861 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0925-8531
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper we show that it is possible to eliminate the "converse" operator from the propositional dynamic logic CPDL (Converse PDL), without compromising the soundness and completeness of inference for it. Specifically we present an encoding of CPDL formulae into PDL that eliminates the converse programs from a CPDL formula, but adds enough information so as not to destroy its original meaning with respect to satisfiability, validity, and logical implication. Notably, the resulting PDL formula is polynomially related to the original one. This fact allows one to build inference procedures for CPDL, by encoding CPDL formulae into PDL, and then nmning an inference procedure for PDL.
📜 SIMILAR VOLUMES
It is shown that internal conversion to the ground state r;in become an important pathway of ndiationIess decay, for molecules in excited vibrational levels. Changes in fluorescence quantum yield as a function of excitation energy have been calculated for the particular case of naphtllalene and arc