The aim of this paper is to introduce the notion of anti fuzzy (prime) deductive system in BL-algebra and to investigate their properties. It is shown that the set of all deductive systems (with the empty set) of a BL-algebra X is equipotent to a quotient of the set of all anti fuzzy deductive systems of X. The anti fuzzy prime deductive system theorem of BL-algebras is also proved. Anti Fuzzy ...

In this article we present a learning method to obtain rules for the semantic query optimization in deductive databases. Semantic query optimization can dramatically speed up deductive database query answering by knowledge intensive reformulation. We will present a learning method for rules that will help to semantically optimize queries for deductive databases.i We tried to change the algorith...

Abstract This paper presents a symbolic method for automatic theorem generation based on deductive inference. Many software verification and reasoning tasks require proving complex logical properties; coping with this complexity is generally done by declaring relevant sub-properties. gives rise to the challenge of discovering useful sub-properties that can assist automated proof process. known ...

Abstract The class of pseudo-M algebras contains pseudo-BCK, pseudo-BCI, pseudo-BCH, pseudo-BE, pseudo-CI and many other logic. In this paper, the notion deductive system in a algebra is introduced its elementary properties are investigated. Closed systems defined studied. homomorphic (closed) provided. concepts translation R-congruences It shown that there bijection between closed R-congruence...

We provide a characterization of those nonmonotonic inference operations C for which C(X) may be described as the set of all logical consequences of X together with some set of additional assumptions S(X) that depends anti-monotonically on X (i.e., X ⊆ Y implies S(Y ) ⊆ S(X)). The operations represented are exactly characterized in terms of properties most of which have been studied in [3]. Sim...

Dong, F. and L.V.S. Lakshmanan, Intuitionistic interpretation of deductive databases with incomplete information, Theoretical Computer Science 133 (1994) 267-306. The aim of this paper is to build the relationship between deductive databases with incomplete information and hypothetical reasoning using embedded implications. We first consider the semantics of deductive databases with incomplete ...