Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Deductive Reasoning

Deductive Reasoning

Deductive reasoning, or deduction, is the type of logic used in hypothesis-based science. In deductive reasoning, the pattern of thinking moves in the opposite direction as compared to inductive reasoning, which means that it uses a general principle or law to predict specific results. From those general principles, a scientist can deduce and predict the specific results that would be valid as long as the general principles are valid.
For example, a researcher can deduce specific predictions...

Inductive Reasoning

Inductive Reasoning

Inductive reasoning is a form of logical thinking that uses related observations to arrive at a general conclusion. It is uncertain and operates in degrees to which the conclusions are credible. As such, inductive arguments can be weak or strong, rather than valid or invalid, and conclusions can be used to formulate testable, falsifiable hypotheses.
Inductive reasoning is common in descriptive science. A life scientist makes observations and records them. This data can be qualitative or...

Mathematical Induction

Mathematical Induction

Mathematical induction is a structured method of proof used to confirm the truth of statements involving natural numbers. Consider the sum of the first n natural numbers:This formula describes a pattern that appears to hold true as more terms are added. To verify that it is valid for all natural numbers, mathematical induction proceeds in two essential steps. The first is the base case, where the formula is tested for the initial value, typically n = 1. Substituting into both sides confirms the...

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...

Statically Indeterminate Problem Solving

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...

Heuristics

Heuristics

Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Sampling of natural speech for the assessment of psychopathology: data collection procedure and inter-rater reliability.

Psychiatry research·2025

Same author

Deduction plans: a basis for intelligent backtracking.

IEEE transactions on pattern analysis and machine intelligence·2011

Same author

[Intrabronchial administration of streptomycin into tuberculous cavities].

Gruzlica (Warsaw, Poland : 1926)·1952

Same author

[A case of tuberculosis of the stomach].

Gruzlica (Warsaw, Poland : 1926)·1952

Same journal

Benchmarking the Robustness of Autonomous Driving to Environmental Illusions: A Lane Perception Perspective.

IEEE transactions on pattern analysis and machine intelligence·2026

Same journal

Learning Topology-Aware Representations via Test-Time Adaptation for Anomaly Segmentation.

IEEE transactions on pattern analysis and machine intelligence·2026

Same journal

TraGraph-GS: Trajectory Graph-based Gaussian Splatting for Arbitrary Large-Scale Scene Rendering.

IEEE transactions on pattern analysis and machine intelligence·2026

Same journal

SWIFT: A Small-World Interaction Framework for Flow-Aware Trajectory Prediction in Autonomous Driving.

IEEE transactions on pattern analysis and machine intelligence·2026

Same journal

HardFlow: Hard-Constrained Sampling for Flow-Matching Models Via Trajectory Optimization.

IEEE transactions on pattern analysis and machine intelligence·2026

Same journal

Industrial Brain: Self-Evolving Neuro-Symbolic Autonomy with Causal Resilience for Cyber-Physical Systems.

IEEE transactions on pattern analysis and machine intelligence·2026

See all related articles

Search research articles

Related Experiment Videos

Intelligent backtracking in plan-based deduction.

S Matwin¹, T Pietrzykowski

¹Department of Computer Science, University of Ottawa, Ottawa, Ont. K1N 9B4, Canada.

IEEE Transactions on Pattern Analysis and Machine Intelligence

|August 27, 2011

Summary

This summary is machine-generated.

This study introduces a novel mechanical deduction method using graphical proof structures and AND/OR graphs. It efficiently detects failure sources, outperforming blind backtracking for automated theorem proving.

Related Experiment Videos

Area of Science:

Computer Science
Artificial Intelligence
Logic

Background:

Automated theorem proving often relies on backtracking search.
Existing methods may struggle to pinpoint exact failure sources in complex proofs.
The need for efficient and precise deduction methods is critical in AI.

Purpose of the Study:

To develop a mechanical deduction method based on graphical proof structures.
To create a system that precisely identifies failure sources in logical derivations.
To demonstrate significant performance improvements over traditional backtracking algorithms.

Main Methods:

Utilizes a graphical representation for the structure of proofs.
Employs AND/OR graph search space to record refutation attempts as plans.
Applies the method to any initial base of non-Horn clauses.

Main Results:

The developed method precisely detects the exact source of failure, unlike blind backtracking.
Achieves exponential improvement over blind backtracking in specific cases.
The algorithm is proven to be complete, finding existing resolution refutations.

Conclusions:

The graphical mechanical deduction method offers a more efficient and precise approach to automated theorem proving.
This technique enhances the reliability and performance of logical deduction systems.
The study presents a robust algorithm with practical implementation considerations.