Proof by contradiction - artificial intelligence, Computer Engineering

Proof by Contradiction - Artificial intelligence

So, both backward chaining andforward chaining have drawbacks. Another approach is to think regarding proving theorems by contradiction. These are so much common in mathematics: mathematicians specify some axioms, and then make an assumption. After some complexes mathematics, they have proven that an axiom is  false  (or  something  derived  from  the  axioms  which  did  not  involve  the assumption is false). As the axioms are irrefutably right, this means that the assumption they made might be false. That is, the assumption is not consistent with the axioms of the theory. To utilize this for a specific theorem which they want to prove is true; they negate the theorem statement and use this as the assumption they are going to display is false. As the negated theorem must be false, their original theorem ought to be true.

We may program our reasoning agents to do just the similar.Therefore, to specify this as a search problem, we need to say that the axioms of our theory and the negation of the theorem we want to prove are the starting search states. Recalling our example in section, to do this, we have to derive the false statement to show inconsistency, that the reason that the False statement becomes our goal. So, if we can deduce the false statement from our axioms, the theorem we were attempting to prove will certainly have been proven. This means that, not only can we use all our rules of inference; we also have goal to aim for.

As an instance, below is the input to the Otter theorem proves for the trivial theorem regarding Socrates being mortal. Otter searches for contradictions by using resolution, hence we notice that the theorem statement that Socrates is mortal is negated  byusing the minus sign.


set(auto). formula_list(usable).

all x (man(x)->mortal(x)). % for all x, if x is man then x is mortal

man(socrates). % Socrates is man

-mortal(socrates).        % Socrates is immortal (note: negated)


Otter has no problem whatsoever proving this theorem, and output is following:



1 [] -man(x)|mortal(x).

2 [] -mortal(socrates).

3 [] man(socrates).

4 [hyper,3,1] mortal(socrates).

5 [binary,4.1,2.1] $F.

Hence  proof

Posted Date: 10/2/2012 8:32:32 AM | Location : United States

Related Discussions:- Proof by contradiction - artificial intelligence, Assignment Help, Ask Question on Proof by contradiction - artificial intelligence, Get Answer, Expert's Help, Proof by contradiction - artificial intelligence Discussions

Write discussion on Proof by contradiction - artificial intelligence
Your posts are moderated
Related Questions
Q. Registers used in IA-64 architecture ? Registers: The IA-64 architecture comprises a very generous set of registers. It has an 82-bit floating point as well as 64-bit inte

1. It is hard even for a highly skilled experts to abstract good situational assessment when he is under time pressure. 2. Expert systems perform well with specific t

How adaptive transmission helps TCP to maximize throughput on each connection? To know how adaptive retransmission helps TCP maximize throughput upon all connection, see a case

Design a BCD to seven segment decoder that accepts a decimal digit in BCS and generates the appropriate output for segments in display indicator. Ans: BCD-TO-seven-Segment

Task Gantt   Task Gantt shows different tasks being performed it implies that numerous kind of activities by set of processors connected to parallel computer as displayed in Fi

Q. What are the basic components of an expert system? ANSWER: There are three components of components: Information, people, and IT components. Information kinds are domain exp

Develop a regular expression for (i) Integer (ii) Real number (i) A regular expression for integer is [+ | -] (d)+ (ii) A regular expression for real number is [+

Q. Find the Physical address of instruction? Value of Instruction Pointer and holding address of instruction = 1234h Value of code segment register (CS) = 448Ah Physical

Describe Real and protected mode: Operation of Real mode interrupt:   When microprocessor completes executing the current instruction, it concludes whether an interrupt is act

what are advantages and disadvantages of bresenham''s line drawing algorithm?