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
In binary counter the flip flop of lowest order position is complemented with each pulse. This means that JK input position must be maintained with logic one

Utility Functions - artificial intelligence: A goal based on an agent for playing chess is infeasible: at every moment it decides which move to play next, it sees whether that

Q. Explain about Karnaugh Maps? Karnaugh maps are a suitable way of expressing and simplifying Boolean function of 2 to 6 variables. The stepwise process for Karnaugh map is.

DeMorgan's first theorem shows the equivalence of which logic gate ? Ans. DeMorgan's first theorem depicts the equivalence of NOR gate and Bubbled AND gate. For De Morgan's

find the minimum total number of shelves including the loading process

How can a parent and child process communicate? A parent and child can communicate by any of the normal inter-process communication schemes (pipes, sockets, message queues, sha

Presumably for heightened tension - first-order logic: As an aside, it's worth pointing out that - presumably for heightened tension - in most Sherlock Holmes books, the m

Q. Show the Features of parallel virtual machine? Easy to install; Easy to configure; Multiple users each can use PVM concurrently; Multiple applications fro

Determine the Uses of memory blocks. Not as common a technique though something to consider. As Verilog has a very convenient syntax for declaring and loading memories, you ca

i want the matlab code for the following events 1. face detection 2. video to frame conversion 3.video shot boundary detection