Inquiry | EPFL Graph Search

Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?

Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.

Découvrez-en plus sur les applications Graph.

An inquiry (also spelled as enquiry in British English) is any process that has the aim of augmenting knowledge, resolving doubt, or solving a problem. A theory of inquiry is an account of the various types of inquiry and a treatment of the ways that each type of inquiry achieves its aim. When three terms are so related to one another that the last is wholly contained in the middle and the middle is wholly contained in or excluded from the first, the extremes must admit of perfect syllogism. By 'middle term' I mean that which both is contained in another and contains another in itself, and which is the middle by its position also; and by 'extremes' (a) that which is contained in another, and (b) that in which another is contained. For if A is predicated of all B, and B of all C, A must necessarily be predicated of all C. ... I call this kind of figure the First. (Aristotle, Prior Analytics, 1.4) Inductive reasoning consists in establishing a relation between one extreme term and the middle term by means of the other extreme; for example, if B is the middle term of A and C, in proving by means of C that A applies to B; for this is how we effect inductions. (Aristotle, Prior Analytics, 2.23) The locus classicus for the study of abductive reasoning is found in Aristotle's Prior Analytics, Book 2, Chapt. 25. It begins this way: We have Reduction (απαγωγη, abduction): When it is obvious that the first term applies to the middle, but that the middle applies to the last term is not obvious, yet is nevertheless more probable or not less probable than the conclusion; Or if there are not many intermediate terms between the last and the middle; For in all such cases the effect is to bring us nearer to knowledge. By way of explanation, Aristotle supplies two very instructive examples, one for each of the two varieties of abductive inference steps that he has just described in the abstract: For example, let A stand for "that which can be taught", B for "knowledge", and C for "morality".

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (15)

Unités associées (5)

Concepts associés (16)

Cours associés (4)

Séances de cours associées (9)

CS-330: Artificial intelligence

Introduction aux techniques de l'Intelligence Artificielle, complémentée par des exercices de programmation qui montrent les algorithmes et des exemples de leur application à des problèmes pratiques.

ME-273: Introduction to control of dynamical systems

Cours introductif à la commande des systèmes dynamiques. On part de quatre exemples concrets et on introduit au fur et à mesure un haut niveau d'abstraction permettant de résoudre de manière unifiée l

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a

, , , , , ,

Language models (LMs) have recently shown remarkable performance on reasoning tasks by explicitly generating intermediate inferences, e.g., chain-of-thought prompting. However, these intermediate inference steps may be in- appropriate deductions from the i ...

2023

Interactive simulations encourage students to practice skills essential to understanding and learning sciences. Alas, inquiry learning with interactive simulations is challenging. In this paper, we seek to identify inquiry patterns across topics and evalua ...

2023

A systematic review of empirical studies using log data from open-ended learning environments to measure science and engineering practices

Engin Walter Bumbacher

Technology-based, open-ended learning environments (OELEs) can capture detailed information of students' interactions as they work through a task or solve a problem embedded in the environment. This information, in the form of log data, has the potential t ...

WILEY2022

Argumentation

L’argumentation est l'action de convaincre et pousser ainsi l'autre à agir. Contrairement à la persuasion, elle vise à être comprise de tous et résiste à l'utilisation d'arguments fallacieux. L’argument est, en logique et en linguistique, l’ensemble des prémisses données en support à une conclusion. Une argumentation est composée d'une conclusion et d'un ou de plusieurs « éléments de preuve », que l'on appelle des prémisses ou des arguments, et qui constituent des raisons d'accepter cette conclusion.

Pragmatic theory of truth

A pragmatic theory of truth is a theory of truth within the philosophies of pragmatism and pragmaticism. Pragmatic theories of truth were first posited by Charles Sanders Peirce, William James, and John Dewey. The common features of these theories are a reliance on the pragmatic maxim as a means of clarifying the meanings of difficult concepts such as truth; and an emphasis on the fact that belief, certainty, knowledge, or truth is the result of an inquiry. Pragmatic theories of truth developed from the earlier ideas of ancient philosophy, the Scholastics.

Pragmaticism

"Pragmaticism" is a term used by Charles Sanders Peirce for his pragmatic philosophy starting in 1905, in order to distance himself and it from pragmatism, the original name, which had been used in a manner he did not approve of in the "literary journals". Peirce in 1905 announced his coinage "pragmaticism", saying that it was "ugly enough to be safe from kidnappers" (Collected Papers (CP) 5.414). Today, outside of philosophy, "pragmatism" is often taken to refer to a compromise of aims or principles, even a ruthless search for mercenary advantage.

Pôles et Valeurs : Techniques de Simplification ME-273: Introduction to control of dynamical systems

Couvre la correction d'un test intermédiaire, des suggestions pour l'examen, et les techniques de simplification des pôles et des valeurs.

Raisonnement incertain : Réseaux bayésiens CS-330: Artificial intelligence

Explore le raisonnement incertain, les réseaux bayésiens et la résolution stochastique, soulignant l'importance de la logique probabiliste et de l'enlèvement.

Logique et algorithmes CS-101: Advanced information, computation, communication I

Couvre la logique, le raisonnement mathématique, les structures de base et les algorithmes, explorant les preuves, les ensembles, les fonctions et la récursion.