The most developed subareas of automated reasoning are automated theorem proving (and the less automated but more pragmatic subfield of interactive theorem proving) and automated proof checking (viewed as guaranteed correct reasoning under fixed assumptions). Extensive work has also been done in reasoning by analogy induction and abduction.

Other important topics include reasoning under uncertainty and non-monotonic reasoning. An important part of the uncertainty field is that of argumentation, where further constraints of minimality and consistency are applied on top of the more standard automated deduction. John Pollock's OSCAR system^{} is an example of an automated argumentation system that is more specific than being just an automated theorem prover.

Tools and techniques of automated reasoning include the classical logics and calculi, fuzzy logic, Bayesian inference, reasoning with maximal entropy and a large number of less formal *ad hoc* techniques.

The development of formal logic played a big role in the field of automated reasoning, which itself led to the development of artificial intelligence. A formal proof is a proof in which every logical inference has been checked back to the fundamental axioms of mathematics. All the intermediate logical steps are supplied, without exception. No appeal is made to intuition, even if the translation from intuition to logic is routine. Thus, a formal proof is less intuitive, and less susceptible to logical errors.^{}

Some consider the Cornell Summer meeting of 1957, which brought together a large number of logicians and computer scientists, as the origin of automated reasoning, or automated deduction.^{} Others say that it began before that with the 1955 Logic Theorist program of Newell, Shaw and Simon, or with Martin Davis’ 1954 implementation of Presburger’s decision procedure (which proved that the sum of two even numbers is even).^{} Automated reasoning, although a significant and popular area of research, went through an "AI winter" in the eighties and early nineties. Luckily, it got revived after that. For example, in 2005, Microsoft started using verification technology in many of their internal projects and is planning to include a logical specification and checking language in their 2012 version of Visual C.^{}

This page was last edited on 2 May 2018, at 04:46.

Reference: https://en.wikipedia.org/wiki/Machine_reasoning under CC BY-SA license.

Reference: https://en.wikipedia.org/wiki/Machine_reasoning under CC BY-SA license.

- Computer Science
- Mathematical Logic
- Reasoning
- Computer Programs
- Artificial Intelligence
- Theoretical Computer Science
- Philosophy
- Automated Theorem Proving
- Interactive Theorem Proving
- Automated Proof Checking
- Analogy
- Induction
- Abduction
- Uncertainty
- Non-monotonic
- Fuzzy Logic
- Bayesian Inference
- Maximal Entropy
- Formal Logic
- Artificial Intelligence
- Formal Proof
- Axioms
- Automated Deduction
- Logic Theorist
- Presburgerâs Decision Procedure
- AI Winter
- Microsoft
- Verification Technology

- Machine Reasoning
- Jeong Mongju
- Volvo B5TL
- Qele, Qele
- Francis Joseph Gossman
- Looking Glass Workshop
- Qi
- MacArthur Central, Brisbane
- Limnothrissa Miodon
- Journal Of Phonetics
- Resonant Kuiper Belt Object
- Nicholas M. Butler
- Pumping Water
- Elmer Miller (outfielder)
- Edentulina Moreleti
- Bachtel Tower
- Chaudhry Shujaat Hussain
- William Alexander Scott
- Keutschacher See
- Audubon Place
- Gustavo Capanema Palace
- James Stirling (1800%E2%80%931876)
- Johannes Aigner
- St Govan%27s Chapel
- Raoul Rochette
- Sons Of Freedom (band)
- Dubai Healthcare City
- Roughhouse (band)
- Axia College
- Spea Multiplicata