In this paper we discuss Gabbay’s idea of basing nonmonotonic deduction on semantic consequence in intuitionistic logic extended by a consistency operator and Turner’s suggestion of replacing the intuitionistic base system by Kleene’s three-valued logic. It is shown that a certain counterintuitive feature of these approaches can be avoided by using Nelson’s constructive logic N instead of intui...

Superdeduction is a formalism closely related to deduction modulo which permits to enrich a first-order deduction system—such as natural deduction or sequent calculus— with new inference rules automatically computed from the presentation of a theory. We give a natural encoding from every Pure Type System (PTS) into superdeduction by defining an appropriate first-order theory. We prove that this...

OWL EL is an extension of the tractable EL description logic. Despite their inference capabilities over TBoxes, DL reasoners have a high ABox reasoning complexity which may constitute a serious limitation in the Semantic Web where we rely mainly on query answering (i.e. instance checking). The subsomption algorithm used in fuzzy EL reduce instance checking into concept satisfiability. To allow ...

In this paper a new parallel version of finding the Fuzzy Reasoning Path (FRP) using the knowledge representation model, introduced by Chandwani & Chaudhari [1] known as Fuzzy Deduction Graph (FDG) is presented. In an FDG, a systematic method of finding the Fuzzy Reasoning Path (FRP) already exists, which is based on Dijkstra's shortest path framework [2]. Our FRP algorithm is conglomerati...

In this paper, we show how a system for automated deduction can be given computational reeection, i.e. can aaect its own computation mechanism, by using the very same machinery implementing logical deduction. This feature, that we call computational reeection via mechanized logical deduction, provides both theoretical and practical advantages. First, the theorem prover can inspect, extend and m...

unknown noise and artifacts present in medical signals with  non-linear fuzzy filter will be estimate and then removed. an adaptive neuro-fuzzy interference system which has a nonlinear  structure presented  for the noise function prediction by before samples. this paper is about a neuro-fuzzy method to estimate unknown noise of electrocardiogram (ecg) signal. adaptive neural combined with fuzz...

In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete disjoint NP-pairs exist. On the other hand, if EF is an optimal proof system, then the weak deduction theorem holds for EF . Hence the weak deduction property for EF is a natural intermediate condition between the optima...

We define a translation that maps higher-order formulas provable in a classical extensional setting to semantically equivalent formulas provable in an intuitionistic intensional setting. For the classical extensional higher-order proof system we define a Henkincomplete tableau calculus. For the intuitionistic intensional higher-order proof system we give a natural deduction calculus. We prove t...

A formalism of analogical reasoning is presented. The analogical reasoning can be considered as a deduction with a function of trans forming logical rules. From this viewpoint, the reasoning is defined in terms of deduction, and is therefore realized in a logic programm ing system. The reasoning system is described as an extension of Prolog interpreter.