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
What is reification? It is the promotion of something that is not an object into an object. Helpful method for Meta applications. It shifts the level of abstraction. Promote

The method(s) of payment for online consumers are A) Electronic cash    (B) Credit/debit C) Electronic checks

Height of a tree The length of the longest path from root to any node is called as the height of the tree.

Simplify the given expressions using Boolean postulates Y = (A + B)(A‾ + C)(B + C) Ans. Y = (A + B)(A‾ + C)(B + C) = (A A‾ + AC + B A‾ + BC) (B + C) = (AC + B A‾ + BC) (B + C)

With the increasing use of more and higher level languages manufacturers had offered more powerful instructions to support them. It was claimed that a stronger instruction set will

One Erlang is equal to (A)  3600 CCS (B)  36 CCS (C) 60 CCS (D)  24 CCS Ans: One Erlang is equivalent to 3600 CCS.

Explain Direct or Indirect Communication in Inter-process communication. Several types of message passing system in Direct or Indirect Communication are given below:

Design a generalization-specialization hierarchy for a motor vehicle sales company. The company sells motorcyles,passenger cars,vans,and buses.justify your placement of attributes

Q. What is Unique port number? A port is an extra 16-bit number which uniquely identifies particular service on any given machine on Internet. Port numbers are 16 bit wide, con

How does VB.NET/C# achieve polymorphism?  VB.Net / C# provide polymorphism through the following mechanisms: 1. Inheritance - base class gives overridable methods which ar