Soundness - artificial intelligence, Computer Engineering

Soundness - artificial intelligence:

You may see in some application domains-for example automated theorem proving - that your search is "sound and complete". The soundness in this kind of theorem proving means that the search to find a proof will not succeed then if you give it to a false theorem to prove. This extends to searching in normally, that where a search is unsound it means there is error because finds a solution to a problem with no solution. This kind of unsound search pattern may not be the end of the world if you are only interested in using it for problems where you know there is a solution (and it performs well in finding such types of hints). Another kind of unsound search is when a search finds the wrong answer to a given question. This is how much worrying about that and the problem will probably lie with the goal testing mechanism.

Additional Knowledge in Search

The amount of extra knowledge available to your agent will effected how it performs. In the given sections of this lecture, we will considered at uninformed search strategies and data, where not any additional knowledge is already given, and heuristic searches, where any information belongs to the goal, intermediate states and the operators can be used to improve the effectiveness of searching strategy.

Posted Date: 1/9/2013 7:15:58 AM | Location : United States







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

Write discussion on Soundness - artificial intelligence
Your posts are moderated
Related Questions
Flynn's Classification  This classification was early proposed and studied by Michael Flynn in 1972. Flynn did not believe the machine architecture for organization of parallel

A ppropriate Problems for Decision Tree Learning - Artificial intelligence It is a expert job in AI to select accurately the right learning representation for a particular lea

PCI bus transactions: PCI bus traffic is prepared of a series of PCI bus transactions. Each transaction is build up of an address phase that is followed by 1 or more data phas

Q. What is the dissimilarity between dynamic strain aging and strain aging? Answer:- Strain aging could be explains as "normal wear and tear" or the fatigue that is experi

Example of circuit switching and S&F (Stored and Forward) switching is (A) Telephone and Post of Telegraph (B) Video Signal Post or Telegraph (C)  Digital Signal P

Explain the principle of duality with examples.

As per the JMS specification, when you are in a transaction, the acknowledge Mode is ignored. If acknowledge() is known as within a transaction, it is ignored.

Full Resolution Rule - Artificial intelligence: Now that we know about unification, we can correctly describe the complete edition of resolution: p1  ∨ ...  ∨ pj  ∨ ...  ∨ p

Q. Sequential Execution of Instructions in RISC? Let's describe pipelining in RISC with an illustration program execution sample. Take the given program (R denotes register).

I''m seeking a challenging professional working position in the field of Information Technology,where I’ll be given the chance to enhance & expand the skills & experience