In automated deduction, the final goal is to achieve a fully automatic proof system: given a logical specification of a problem, take a high-performance theorem prover, and let it do the work. Unfortunately, this does not work in practice, not only because theorem provers often lack finding the proof within reasonable time, but also because the specification is error-prone. For the latter, in t...

In other words, abduction, deduction, and induction work together to explore. In recent years many Monte Carlo simulations have been.induction and abduction reasoning operators, resulting in the proposal that our. Deduction, generalized induction and generalized abduction. Have been implemented and tested within a simulation environment 5.Deduction, Quantitative and Qualitative Induction, Abduc...

An object-oriented language with automatic synthesis of methods (programs) and transformations of OO descriptions using a logical metalanguage (Horn-clause logic) are considered. Automatic synthesis of methods (Proof-As-Program approach) is based on intuitionistic propositional calculus. The metalanguage expresses general knowledge related to classes and objects and it is used for describing tr...

In [NF96] a very efficient system for solving diagnosis tasks has been described, which is based on belief revision procedures and uses first order logic system descriptions. In this paper we demonstrate how such a system can be rigorously formalized from the viewpoint of deduction by using the calculus of hyper tableaux [BFN96]. The benefits of this approach are twofold: first, it gives us a c...

In our paper we follow the development of our approach of regarding programming as logical reasoning in intuitionistic linear logic. We present basic notions of linear logic and its deduction system and we define categorical semantics of linear logic as a symmetric monoidal closed category. Then we construct linear type theory over linear Church’s types involving linear calculus with equational...

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.

An object-oriented language with automatic synthesis of methods (programs) and transformations of OO descriptions using a logical metalanguage (Horn-clause logic) are considered. Automatic synthesis of methods (Proof-As-Program approach) is based on in-tuitionistic propositional calculus. The metalanguage expresses general knowledge related to classes and objects and it is used for describing t...

The use of artificial intelligence to represent and reason about metabolic networks has been widely investigated due to the complexity of their imbrication. Its main goal is to determine the catalytic role of genomes and their interference in the process. This paper presents a logical model for metabolic pathways capable of describing both positive and negative reactions (activations and inhibi...

Researchers in artiicial intelligence have recently been taking great interest in hybrid representations , among them sorted logics|logics that link a traditional logical representation to a taxonomic (or sort) representation such as those prevalent in semantic networks. This paper introduces a general framework|the substitutional framework|for integrating logical deduction and sortal deduction...

Several notions of redundancy exist for Association Rules. Often, these notions take the form “any dataset in which this first rule holds must obey also that second rule, therefore the second is redundant”; if we see datasets as interpretations (or models) in the logical sense, this is a form of logical entailment. In many logics, entailment has a syntactic counterpart in the form of a deductio...