Drawbacks to resolution theorem, Computer Engineering

Drawbacks to resolution theorem:

Thus the underlining here identifies some drawbacks to resolution theorem proving:

  • It only works for true theorems that can be expressed in first order logic:

Just cannot to check at the same time where a conjecture is true or false, but it can't work in higher order logics. So if there are related techniques which address these problems, than to varying degrees of success. 

  • While it is proven such the method will find the solution, there in practice the search space is often too large to find one in a reasonable amount of time, so even for fairly simple theorems.

 

So notwithstanding these drawbacks, there resolution theorem proving is a complete method: but if your theorem does follow from the axioms of a domain so such resolution can prove it. However, it only uses one rule of deduction the resolution but the multitude we saw in the last lecture. Thus it is comparatively simple to understand how resolution theorem provers work. Here for these reasons and the development of the resolution method was a major accomplishment in logic in which with serious implications to "Artificial Intelligence" research. 

There resolution works by taking two sentences and resolving them with one ultimately resolving two sentences to produce the False statement. So we can say that the resolution rule is more complicated other than the rules of inference we've seen before we require  to cover some preparatory notions before we can understand how it works. Now here in particularly we use to look at conjunctive normal form and unification before we can state the full resolution rule at the heart of the resolution method to justified.

Posted Date: 1/11/2013 6:13:41 AM | Location : United States







Related Discussions:- Drawbacks to resolution theorem, Assignment Help, Ask Question on Drawbacks to resolution theorem, Get Answer, Expert's Help, Drawbacks to resolution theorem Discussions

Write discussion on Drawbacks to resolution theorem
Your posts are moderated
Related Questions
Problem: (a) Cellular systems are based on two types of multiplexing, what are those two types of multiplexing? Describe how they are used to improve channel allocation in cel

What are the gates required to build a half adder ? Ans. The gates needed to build a half adder are EX-OR gate and AND gate as shown below the logic diagram of half adder:

Handshake control of data transfer during an input operation:   . Handshake control of data transfer during an output operation o   Interface to CPU and Memory o

What are Parallel Algorithms? The central assumption of the RAM model does not hold for some newer computers that can implement operations concurrently, i.e., in parallel algor


Example of Bitwise-AND Operator In the following example, the bitwise-AND operator (&) compares the bits of two integers, nNumA and nNumB: // Example of the bitwise-AND oper

Existential Introduction: Now if we have any sentence as, A, and variable, v, that does not occur in A, so then for any ground term, g, such occurs in A, than we can turn A in

Define Radix (or)Base. A number system of base or radix is a system that uses different symbols for r digits. Numbers are shown by a string of digit symbols. To verify the quan

Q. Explain about working of Multiplexer? Multiplexer is one of the fundamental building units of a computer system that in principle permits sharing of a common line by more th

Address symbol table is generated by the  (A) memory management software.  (B) assembler.  (C) match logic of associative memory.   (D) generated by operating system