We formalize a mathematical approach to probabilistic logic for zero-order logic and derive new inequalities that are necessary and sufficient for consistent probability assignments to propositions. We prove that a complete theory of probabilistic logic requires the a priori assignment of probabilities for a system with k basic propositions. We also show that a proposal due to Cheeseman, namely...

it is important to reduce keeping costs and hold up unscheduled downtimes for machinery. So knowledge of what, where and how faults occur is very important. In machine rotation and machine learning Fault diagnosis and detection are important rule. In this paper offer a method based on kernel method that using in fault occur. For this reason create kernel by wavelet packet with associate rule mi...

Let S be a Noetherian scheme, φ : X → Y a surjective S-morphism of S-schemes, with X of finite type over S. We discuss what makes Y of finite type. First, we prove that if S is excellent, Y is reduced, and φ is universally open, then Y is of finite type. We apply this to understand Fogarty’s theorem in “Geometric quotients are algebraic schemes, Adv. Math. 48 (1983), 166–171” for the special ca...

Constructing a knowledge based system requires the identification of the conceptual primitives and problem-solving strategy that will permit capturing the expertise in an adapted way. This paper presents an approach to support the elaboration of such a conceptual model by data-abstraction. Our work is motivated by the objective of constructing models that correspond to how experts solve problem...

This paper presents the outline and performance of an automatic syllable boundary detection system. The syllabification of phonemes is performed with a rule-based system, implemented in a Java program. Phonemes are categorized into 6 classes and specific rules are developed to deal with a French spontaneous speech corpus. Moreover, the proposed phonemes, classes and rules are listed in an exter...