Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base which contains a set of conditional events with probability intervals. In this paper, we investigate the issue of revising such a PLP in light of receiving new information. We propose postulates for revising PLPs when a n...

In recent decades, special attention has been devoted to the protection and improvement of environment, efforts are being made adopt implement appropriate laws, regulations, measures, etc. Due fact that right a healthy environment is one basic human rights, subject research in paper an analysis concept, principles instruments environmental protection, with aim pointing out postulates, as well b...

The basic structure of standard quantum mechanics is derived from two compatible postulates. They are: 1) The laws of physics are invariant under the choice of experimental setup and 2) Every quantum observation or event is intrinsically statistical. The resulting geometric formulation naturally leads to a background independent extension of quantum theory with a local intrinsic time implying t...

Article outlines methods of introduction experimental system vocational training future physical culture teachers for organization individual work with pupils. It has been underlined that the developed provided reasonable selection, structuring and construction content study material in selected disciplines taking into account a purposeful influence on formation each component readiness In proc...

The discussion in the computer-science literature of the relative merits of linearversus branching-time frameworks goes back to early 1980s. One of the beliefs dominating this discussion has been that the linear-time framework is not expressive enough semantically, making linear-time logics lacking in expressiveness. In this work we examine the branching-linear issue from the perspective of pro...

Most merging operators are defined by semantics methods which have very high computational complexity. In order to have operators with a lower computational complexity, some merging operators defined in a syntactical way have be proposed. In this work we define some syntactical merging operators and exploring its rationality properties. To do that we constrain the belief bases to be sets of for...

Just as Koch's postulates formed the foundation of early infectious disease study, Stanley Falkow's molecular Koch's postulates define best practice in determining whether a specific gene contributes to virulence of a pathogen. Fundamentally, these molecular postulates state that if a gene is involved in virulence, its removal will compromise virulence. Likewise, its reintroduction should resto...