Semantic generalizations for proving and disproving conjectures by analogy

DOI10.1023/A:1005944606876MaRDI QIDQ1382153zbMATH OpenOpenAlexFDO

Authors Gilles Défourneaux, Christophe Bourely, Nicolas Peltier

Publication date 2 June 1998

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1005944606876

zbMATH Keywords

model building

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• Analogy in inductive theorem proving
• scientific article; zbMATH DE number 4090850
• Analogy in automated deduction: a survey
• Analogy and axiomatics
• scientific article; zbMATH DE number 1670908
• scientific article; zbMATH DE number 4035794
• Building proofs or counterexamples by analogy in a resolution framework
• A semantical view of proof systems

Cited in

(10)

• Analogy in inductive theorem proving
• A semantics and methodology for \textit{ceteris paribus} hypotheses
• Proving theorems by reuse
• A review and prospect of readable machine proofs for geometry theorems
• Tractable and intractable second-order matching problems
• scientific article; zbMATH DE number 4090850 (Why is no real title available?)
• A new application for explanation-based generalisation within automated deduction
• Partial matching for analogy discovery in proofs and counter-examples
• Building proofs or counterexamples by analogy in a resolution framework
• Analogy in automated deduction: a survey

This page was built for publication: Semantic generalizations for proving and disproving conjectures by analogy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382153)