Unverified60% confidenceFactExact time
Hoare logic was proposed by computer scientist Tony Hoare in 1969, providing mathematical deductive proof of program correctness through precondition–program statement–postcondition triples.
2
Sources
60%
Confidence
Long-term
Relevance
7/18/2026
First Seen
Sources
Related Claims
UnverifiedThe resolution method proposed by J.A. Robinson in 1965 became the cornerstone of automated reasoning in first-order logic.64% similarUnverified结构化编程定理由计算机科学家Böhm和Jacopini在1966年证明，即顺序、分支和循环三种基本控制流结构可以表达任意复杂的逻辑63% similarVerifiedThe computer-assisted proof of the four-color theorem was first published by Kenneth Appel and Wolfgang Haken in 1976, requiring computer verification of 1,936 irreducible configurations, and is the first important theorem proof in the history of mathematics to essentially depend on a computer60% similarUnverifiedThe Moravec paradox was proposed by AI pioneer Hans Moravec and others in the 1980s, and its core point is: high-level intelligence such as logical reasoning and mathematical operations is relatively easy for computers, while low-level abilities such as perception, movement, and grasping instead require enormous computational resources to simulate.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/548403API
curl https://kongchang.com/api/v1/knowledge/claims/548403MCP
get_claim(id=548403)