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

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

We present an approach for studying logical properties of problemsolving methods (PSMs) for knowledge-intensive tasks. It is based on semantic tableaux (a deduction-style theorem-proving technique). We show how tableaux can be manipulated in a methodical way to formalize non-deductive style PSMs.

Elementary deduction is the ability of unreflectively drawing conclusions from explicit or implicit premises, on the basis of their logical forms. This ability is involved in many aspects of human cognition and interactions. To date, limited evidence exists on its cortical bases. We propose a model of elementary deduction in which logical inferences, memory, and meta-logical control are separab...

Determining semantic textual similarity is a core research subject in natural language processing. Since vector-based models for sentence representation often use shallow information, capturing accurate semantics is difficult. By contrast, logical semantic representations capture deeper levels of sentence semantics, but their symbolic nature does not offer graded notions of textual similarity. ...

The goal of this paper is to present a reasoning system, called METAFOL, embodying the features of a self-reeective system, i.e. a system which has a representation of its own code and is able to reason about and, possibly, extend or modify it. These features have been achieved by employing a logical meta-theory, which represents the computation implementing deduction in its object theory. Comp...

In the present paper we deal with two approaches suitable to formal treatment of semantical network based reasoning , that are Evolving Algebras (EA) and Labelled Deduc-tive Systems (LDS). The evolving algebras methodology give a tools for precise operational description of the any computational process at the desired level of abstraction, while labelled deduction systems allows to treat variou...

the aim of this research is survey of bandura theoretical foundation of self efficacy include psychological, social, and philosophical base. in this research use analytic – deduction research method to achieve the aim. thus as psychological basis, the concepts of reciprocal determinism, consciousness, learning and finally the human agency will be discussed. under the social basis the effect of ...