Proof by contradiction, Computer Engineering

Proof by Contradiction:

Now for forward chaining and backward chaining both have drawbacks. But another approach is to think about proving theorems by contradiction. So we can say these are very common in mathematics: mathematicians simply some axioms, after do this make an assumption. In fact after some complicated mathematics there they have shown like an axiom is false or something derived from the axioms that did not involve the assumption is false. So as the axioms are irrefutably correct because the assumption they made must be false. However the assumption is inconsistent with the axioms of the theory. Just To need this for a particular theorem that they want to prove is true but they negate the theorem statement for use this as the assumption they are going to show is false. But as the negated theorem must be false, then their original theorem must be true. Bingo! 

Now we can program our reasoning agents to do just the same. Just to simplify this as a search problem, then therefore we have to say that as the axioms of our theory and the negation of the theorem that we want to prove are the initial search states. Thus if we can deduce the false statement from our axioms so the theorem we were trying to prove will the false statement from our axioms and the theorem we were trying to prove will indeed have been proven. Because not only can we use all our rules of inference also have a goal to aim for.

Posted Date: 1/11/2013 6:08:52 AM | Location : United States

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

Write discussion on Proof by contradiction
Your posts are moderated
Related Questions
CGI is significant whenever you require to retain state information about a user, or run an application which communicates with the server. Things like guestbook's, Chat clients, d

What is the advantage of wrapping database calls into MTS transactions? Ans) If database calls are made within the context of a transaction, aborting the transaction will undo a

State the advantages of Bespoke Software -  specifically designed for application and hence more efficient and will only contain the features wanted; as it will be devoid of

What is a flip-flop? Ans. Flip-flop is particular bit memory cell. This stores individual bit information in its true and compliment form. It is the basic block of any sequ

Three state table buffers Three state table buffers: A bus system can be constructed with the help of three state gates instead of multiplexers. A three states gate is digital

Explain at least one modulation technique used for high speed modems. FSK - Frequency Shift Keying: In such technique the frequency of the carrier signal is changed as per to

Q Use as few gates as possible, design a NAND-to-AND gate network that realize the following Boolean algebra expression. ABCD + A'BC'D + A'BC'D' + A'BCD + (A'B'C'D' + A'BCD')

With the help of a truth table explain the working of a half subtractor. Draw the logic diagram using gates. Ans: Half Subtractor: For the subtraction of B (subtrahend) f

Give the Schematic of Interpretation of HLL program and execution of a machine language program by the CPU. The CPU utilizes a program counter (PC) to notice the address of nex

Give example of Real time (transaction) processing Using this illustration of booking seats on a flight, below sequence of events would occur: -  Customer/travel agent conta