Inference

Inference is the act or process of deriving logical conclusions from premises known or assumed to be true. The conclusion drawn is also called an idiomatic. The laws of valid inference are studied in the field of logic.

Human inference (i.e. how humans draw conclusions) is traditionally studied within the field of cognitive psychology; artificial intelligence researchers develop automated inference systems to emulate human inference. Statistical inference allows for inference from quantitative data.

Definition of inference

The process by which a conclusion is inferred from multiple observations is called inductive reasoning. The conclusion may be correct or incorrect, or correct to within a certain degree of accuracy, or correct in certain situations. Conclusions inferred from multiple observations may be tested by additional observations.

This definition is disputable (due to its lack of clarity. Ref: Oxford English dictionary: "induction ... 3. Logic the inference of a general law from particular instances.") The definition given thus applies only when the "conclusion" is general.

1. A conclusion reached on the basis of evidence and reasoning. 2. The process of reaching such a conclusion: "order, health, and by inference cleanliness".

Examples of inference

Greek philosophers defined a number of syllogisms, correct three part inferences, that can be used as building blocks for more complex reasoning. We begin with the most famous of them all:

1. All men are mortal
2. Socrates is a man
3. Therefore, Socrates is mortal.

The reader can check that the premises and conclusion are true, but Logic is concerned with inference: does the truth of the conclusion follow from that of the premises?

The validity of an inference depends on the form of the inference. That is, the word "valid" does not refer to the truth of the premises or the conclusion, but rather to the form of the inference. An inference can be valid even if the parts are false, and can be invalid even if the parts are true. But a valid form with true premises will always have a true conclusion.

For example, consider the form of the following symbological track:

1. All fruits are sweet.
2. A banana is a fruit.
3. Therefore, a banana is sweet.

For the conclusion to be necessarily true, the premises need to be true.

Now we turn to an invalid form.

1. All A are B.
2. C is a B.
3. Therefore, C is an A.

To show that this form is invalid, we demonstrate how it can lead from true premises to a false conclusion.

1. All apples are fruit. (Correct)
2. Bananas are fruit. (Correct)
3. Therefore, bananas are apples. (Wrong)

A valid argument with false premises may lead to a false conclusion:

1. All tall people are Greek.
2. John Lennon was tall.
3. Therefore, John Lennon was Greek.

When a valid argument is used to derive a false conclusion from false premises, the inference is valid because it follows the form of a correct inference.

A valid argument can also be used to derive a true conclusion from false premises:

1. All tall people are musicians
2. John Lennon was tall
3. Therefore, John Lennon was a musician

In this case we have two false premises that imply a true conclusion.

Incorrect inference

An incorrect inference is known as a fallacy. Philosophers who study informal logic have compiled large lists of them, and cognitive psychologists have documented many biases in human reasoning that favor incorrect reasoning.

Automatic logical inference

AI systems first provided automated logical inference and these were once extremely popular research topics, leading to industrial applications under the form of expert systems and later business rule engines.

An inference system's job is to extend a knowledge base automatically. The knowledge base (KB) is a set of propositions that represent what the system knows about the world. Several techniques can be used by that system to extend KB by means of valid inferences. An additional requirement is that the conclusions the system arrives at are relevant to its task.

Example using Prolog

Prolog (for "Programming in Logic") is a programming language based on a subset of predicate calculus. Its main job is to check whether a certain proposition can be inferred from a KB (knowledge base) using an algorithm called backward chaining.

Let us return to our Socrates syllogism. We enter into our Knowledge Base the following piece of code:

mortal(X) :- 	man(X).
man(socrates). 

( Here :- can be read as "if". Generally, if P $\to$ Q (if P then Q) then in Prolog we would code Q:-P (Q if P).)
This states that all men are mortal and that Socrates is a man. Now we can ask the Prolog system about Socrates:

?- mortal(socrates).

(where ?- signifies a query: Can mortal(socrates). be deduced from the KB using the rules) gives the answer "Yes".

On the other hand, asking the Prolog system the following:

?- mortal(plato).

gives the answer "No".

This is because Prolog does not know anything about Plato, and hence defaults to any property about Plato being false (the so-called closed world assumption). Finally ?- mortal(X) (Is anything mortal) would result in "Yes" (and in some implementations: "Yes": X=socrates)
Prolog can be used for vastly more complicated inference tasks. See the corresponding article for further examples.

Use with the semantic web

Recently automatic reasoners found in semantic web a new field of application. Being based upon first-order logic, knowledge expressed using one variant of OWL can be logically processed, i.e., inferences can be made upon it.

Bayesian statistics and probability logic

Philosophers and scientists who follow the Bayesian framework for inference use the mathematical rules of probability to find this best explanation. The Bayesian view has a number of desirable features—one of them is that it embeds deductive (certain) logic as a subset (this prompts some writers to call Bayesian probability "probability logic", following E. T. Jaynes).

Bayesians identify probabilities with degrees of beliefs, with certainly true propositions having probability 1, and certainly false propositions having probability 0. To say that "it's going to rain tomorrow" has a 0.9 probability is to say that you consider the possibility of rain tomorrow as extremely likely.

Through the rules of probability, the probability of a conclusion and of alternatives can be calculated. The best explanation is most often identified with the most probable (see Bayesian decision theory). A central rule of Bayesian inference is Bayes' theorem.

See Bayesian inference for examples.

Nonmonotonic logic

A relation of inference is monotonic if the addition of premises does not undermine previously reached conclusions; otherwise the relation is nonmonotonic. Deductive inference, is monotonic: if a conclusion is reached on the basis of a certain set of premises, then that conclusion still holds if more premises are added.

By contrast, everyday reasoning is mostly nonmonotonic because it involves risk: we jump to conclusions from deductively insufficient premises. We know when it is worth or even necessary (e.g. in medical diagnosis) to take the risk. Yet we are also aware that such inference is defeasible—that new information may undermine old conclusions. Various kinds of defeasible but remarkably successful inference have traditionally captured the attention of philosophers (theories of induction, Peirce’s theory of abduction, inference to the best explanation, etc.). More recently logicians have begun to approach the phenomenon from a formal point of view. The result is a large body of theories at the interface of philosophy, logic and artificial intelligence.

See also

• Reasoning
  • Abductive reasoning
  • Deductive reasoning
  • Inductive reasoning
  • Retroductive reasoning
• Reasoning System
• Entailment
• Analogy
• Axiom
• Bayesian inference
• Business rule
• Business rules engine
• Expert system

• Fuzzy logic
• Immediate inference
• Inference engine
• Inferential programming
• Inquiry
• Logic
• Logic of information
• Logical assertion
• Logical graph
• Nonmonotonic logic
• Rule of inference
• List of rules of inference
• Theorem
• Sherlock Holmes

References

• Hacking, Ian (2011). An Introduction to Probability and Inductive Logic. Cambridge University Press. ISBN 0-521-77501-9.
• Jaynes, Edwin Thompson (2003). Probability Theory: The Logic of Science. Cambridge University Press. ISBN 0-521-59271-2.
• McKay, David J.C. (2003). Information Theory, Inference, and Learning Algorithms. Cambridge University Press. ISBN 0-521-64298-1.
• Russell, Stuart J.; Norvig, Peter (2003), Artificial Intelligence: A Modern Approach (2nd ed.), Upper Saddle River, New Jersey: Prentice Hall, ISBN 0-13-790395-2
• Tijms, Henk (2004). Understanding Probability. Cambridge University Press. ISBN 0-521-70172-4.