**Automated reasoning** is an area of computer science and mathematical logic dedicated to understanding different aspects of reasoning. The study in automated reasoning helps produce software which allows computers to reason completely, or nearly completely, automatically. Although automated reasoning is considered a sub-field of artificial intelligence it also has connections with theoretical computer science and even philosophy.

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 are 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.

Read more about Automated Reasoning: Early Years, Significant Contributions, Proof Systems, Applications

### Other articles related to "automated reasoning, automated":

**Automated Reasoning**- Applications

...

**Automated reasoning**has been most commonly used to build

**automated**theorem provers ...

**Automated reasoning**programs are being applied to solve a growing number of problems in formal logic, mathematics and computer science, logic programming, software and hardware verification, circuit design, and ... There is also a competition among

**automated**theorem provers held regularly at the CADE conference (Pelletier, Sutcliffe and Suttner 2002) the problems for the competition are ...

... US-based computer scientist working in the field of

**automated reasoning**... Provers (TPTP) problem library, and of the TPTP language for formal specification of

**Automated**theorem proving problems and solutions ... (CASC), associated with the Conference on

**Automated**Deduction and International Joint Conference on

**Automated Reasoning**...

**Automated Reasoning**

... In artificial intelligence and computer science, scientists study and use

**automated reasoning**for diverse applications including

**automated**theorem proving the formal ...

**Automated Reasoning**

... Conferences on

**automated reasoning**IJCAR - International Joint Conference on

**Automated Reasoning**CADE - Conference on

**Automated**Deduction TABLEAUX - International Conference on ...

### Famous quotes containing the words reasoning and/or automated:

“It is certain that the only hope of retroductive *reasoning* ever reaching the truth is that there may be some natural tendency toward an agreement between the ideas which suggest themselves to the human mind and those which are concerned in the laws of nature.”

—Charles Sanders Peirce (1839–1914)

“Nature is a self-made machine, more perfectly *automated* than any *automated* machine. To create something in the image of nature is to create a machine, and it was by learning the inner working of nature that man became a builder of machines.”

—Eric Hoffer (1902–1983)