Automated reasoning is an area of computer science dedicated to understanding different aspects of reasoning in a way that allows the creation of software which allows computers to reason completely or nearly completely automatically. As such, it is usually considered a subfield of artificial intelligence, but it also has strong connections to theoretical computer science and even philosophy.

The most developed subarea of automated reasoning is probably automated theorem proving (viewed as guaranteed correct reasoning under fixed assumptions), but 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. Formal argumentation is subfield of artificial intelligence.

Tools and techniques include the classical logics and calculi from automated theorem proving, but also fuzzy logic, Bayesian inference, reasoning with maximal entropy and a large number of less formal ad-hoc techniques.

More on [ Automated reasoning ]

Automated Reasoning - Twitter Search

Using automated reasoning in universal algebra: Several examples http://tinyurl.com/yax9st7
carolinafv1sa (Carolina Harmon) Fri, 06 Nov 2009 13:07:34 -0000
Using automated reasoning in universal algebra: Several examples http://tinyurl.com/yax9st7
そう、「自動推論 (Automated Reasoning)」クラスタの方々である!!
Yuichirou (Yuichirou Ogami) Sun, 01 Nov 2009 14:44:53 -0000
そう、「自動推論 (Automated Reasoning)」クラスタの方々である!!

Subscribe to Automated_Reasoning RSS feed