Any scientific discovery must include an epistemic process to gain knowledge of or to ascertain the existence of some empirical and/or logical entailments previously unknown or unrecognized. The epistemic operation of deduction in an epistemic process of an agent is to fred new and valid entailments logically from some premises which are known facts and/or assumed hypothesis. Automated theorem ...

This paper presents a survey of some results which have been obtained in ISDCT in the field of development of some new methods for logical control of dynamical systems. Some fundamental difficulties of deduction problem were a barrier to the wide development and application of automated deduction in the loop of control. The main point of this paper is to show that automatic theorem proving tech...

This chapter considers the two main approaches to deductive thinking: theories based on formal rules of inference postulate that deduction is a syntactic process akin to a logical proof; the mental model theory postulates that it is a semantic process akin to the search for counterexamples. Experimental evidence bears out the predictions of the model theory: the more models needed for a deducti...

Since at least the early 1980s there has been an effort to utilize multiple processors for logical reasoning. Prior to the rise of the multi-core desktop computer, this often meant parallel algorithms on specialized hardware. Parallel logic programming systems designed during that same period were less attached to a particular parallel architecture, but parallelizing Prolog is a very complex pr...

The logic of abduction and deduction contribute to our conceptual understanding of a phenomenon, while the logic of induction adds quantitative details to our conceptual knowledge. In this paper, we will look into how this reasoning techniquesabduction, deduction and induction, are relevant in neural networks logic programming. Deduction simplifies the knowledge representation without affecting...

A logical space is a pair of a non-empty set and a subset of , and a deduction pair on is a pair of a subset of and a relation between ∗ and . It will be shown that we can understand the true nature of logical completeness via consideration of those simple notions.

The Mizar project is a long-term eeort aimed at developing software to support a working mathematician in preparing papers. A. Trybulec, the leader of the project, has designed a language for writing formal mathematics. The logical structure of the language is based on a natural deduction system developed by Ja skowski. The texts written in the language are called Mizar articles and are organiz...

Derivations and proofs are a form of provenance in automated deduction that can assist users in understanding how reasoners derive logical consequences from premises. However, system-generated proofs are often overly complex or detailed, and making sense of them is non-trivial. Conversely, without any form of provenance, it is just as hard to know why a certain fact was derived. We study proven...

According to current psychological models of deduction, people can draw inferences on the basis of information that they receive from different sources at different times. In 3 reading-comprehension experiments, the authors demonstrated that premises that appear far apart in a text (distant) are not accessed and are therefore not used as a basis for logical inferences (Experiment 1), unless the...

Formal verification (FV) involves the use of logical reasoning to establish properties of a computer program (or hardware element, protocol etc.) In the purest form of FV, rigorous logical deduction is used to prove with full mathematical rigor that the program satisfies a logical specification. This is often contrasted with the traditional approach of testing on a variety of specific inputs or...