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...

Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations; (ii) its semantic framework and logical fram...

A new methodology for the analysis and forecasting of time series is proposed. It directly employs two soft computing techniques: the fuzzy transform and the perception-based logical deduction. Thanks to the use of both these methods, and to the innovative approach, consisting of the construction of several independent models, the methodology is successfully applicable to robust long-time predi...

In this article, we return to the problem of the derivation of a conclusion on the basis of fuzzy IF–THEN rules. The, so called Mamdani method is well elaborated and widely applied. In this article, we present an alternative to it. The fuzzy IF–THEN rules are here interpreted as genuine linguistic sentences consisting of the so called evaluating linguistic expressions. Sets of fuzzy IF–THEN rul...

In an effort to assess models of inductive reasoning and deductive reasoning, the authors, in 3 experiments, examined the effects of argument length and logical validity on evaluation of arguments. In Experiments 1a and 1b, participants were given either induction or deduction instructions for a common set of stimuli. Two distinct effects were observed: Induction judgments were more affected by...

We review recent results on inferencing for SROEL(×), a description logic that subsumes the main features of the W3C recommendation OWL EL. Rule-based deduction systems are developed for various reasoning tasks and logical sublanguages. Certain feature combinations lead to increased space upper bounds for materialisation, suggesting that efficient implementations are easier to obtain for suitab...

Fuzzy logics based on residuated t-norms provide a robust mathematical formalism for logical deduction under uncertain or vague premises. In this paper, we describe a decision algorithm for the tautology problem of Basic Logic, which is the logic of continuous t-norms and their residua [Háj98, CEGT00]. Our algorithm is a refinement of the semantic method of Baaz, Hájek, Montagna, and Veith [BHM...