Artificial Inteligence Assignment
Unit 3 A
Be sure to carefully follow the syntax and semantics of each representational scheme.
For pictorial/graphical representations, you may hand draw them, scan them, and import them into your document. Or, you may use the drawing tools available in your software app.
For quantifiers in predicate logic, feel free to use A and E if you are unable to produce the specialized symbols (∀ and ∃)
For help with logic, review the handout online. There are many other resources available on predicate logic, for example: http://www.cs.odu.edu/~toida/nerzic/content/logic/pred_logic/intr_to_pred_logic.html
1)
Represent the following facts as a set of frames:
“The aorta is a particular kind of artery which has a diameter of 2.5 cm.
An artery is a kind of blood vessel.
An artery always has a muscular wall, and generally has a diameter of 0.4 cm.
A vein is a kind of blood vessel, but has a fibrous wall.
Blood vessels all have tubular form and contain blood.”
2)
Represent the following facts in the language of predicate logic:
Every apple is either green or yellow.
No apple is blue.
If an apple is green then it is tasty.
Every man likes a tasty apple.
3)
“Herbert is a small hippopotamus who lives in Edinburgh zoo. Like all hippopotamuses he eats grass and likes swimming.” Represent the above:
· as a semantic network;
· in predicate logic
For quantifiers, feel free to use “A” and “E” if you are unable to produce the specialized symbols
1. Develop a simple set of rules for diagnosing respiratory symptom diseases given patient symptoms, using the following knowledge of typical symptoms. Describe how a simple backward chaining interpreter could be used to go through the possible diagnoses, asking the user questions about their symptoms. If you have an expert system shell available, try implementing a simple diagnosis system based on the above.
· Influenza: Symptoms include a persistent dry cough and a feeling of general malaise.
· Hayfever: Symptoms include a runny nose and sneezing. The patient will show a positive reaction to allergens, such as dust or pollen.
· Laryngitis: Symptoms include a fever, a dry cough, and a feeling of general malaise. A “laryngoscopy” will reveal that the person has an inflamed larynx.
· Asthma: Symptoms include breathlessness and wheezing. If it is triggered by an allergen, such as dust or pollen, it is likely to be “extrinsic asthma”. “Intrinsic asthma” tends to be triggered by exercise, smoke or a respiratory infection.
2. What do you think are the main problems and limitations of the rule-set developed for the question above? What additional knowledge might be useful to deal with more complex or subtle diagnoses?
Unit 3 E
In exercise 1, create the parse tree for each sentence. Sentences which can be recognized will have a complete parse tree while unrecognized sentences will have incomplete parse trees. Be sure to indicate which sentences are recognized.
In exercise 2, list the full DCG notation for the extended grammar. Test your grammar by using Amzi prolog.
Amzi Prolog allows DCG to be input directly. Therefore, you can enter your grammar exactly as you would create it for problem #2, page 123. For example, you can enter: sentence –> np(N), vp(N). etc.
The only “trick” is how to specify the sentence to check for proper grammar. Here’s how:
?- sentence([word1,word2,word3,etc],[]).
note the use of square brackets within the parentheses, each word of the sentence is entered between commas, and the final argument [] (open bracket, close bracket). Thus to check whether “All rabbits eat carrots” is syntactically correct, enter
?- sentence([all,rabbits,eat,carrots],[]).
Examples:
?- sentence([the,rabbit,eats,the,carrot],[]).
yes
?- sentence([rabbit,the,carrot,eats,the],[]).
no
Submit the .pro file as text copied within the document you submit here. Please upload one document with all exercise answers along with your name and ID#
The following is a grammar of a subset of English in DCG notation:
· sentence –> np(N), vp(N).
· np(N) –> det, noun(N).
· vp(N) –> verb(N), np(_).
· noun(s) –> [carrot].
· noun(s) –> [rabbit].
· noun(p) –> [rabbits].
· verb(s) –> [eats].
· det –> [the].
1. Which of the following sentences can be recognized with this Grammar?
· The carrot eats the carrot.
· The rabbits eats the carrot.
· The rabbit eats carrots.
For each sentence which is recognized by the grammar, show its parse tree.
2. Extend the grammar to handle sentences like the following. “All” and “some” should be treated as kinds of determiner (det).
· All rabbits eat carrots.
· Some rabbits eat the carrot.
· The rabbit eats every carrot.
The grammar should NOT allow sentences that are grammatically incorrect because a plural noun (e.g. carrots) is used with a determiner that can only be used with singular nouns (e.g., a, every) or vice versa, e.g.,
· All rabbit eat the carrot.
· A rabbits eat the carrot
· Every rabbits eat the carrots.
Try out your grammar using Prolog.
Unit 4 B
Apply the difference operator mask on page 129 to the image on page 128. Notes: use a threshold of 2; use the absolute value of the difference operation; the resulting matrix will be 7×7 rather than 8×8 (as the original is).
List the resulting matrix and show your work in computing it. This is a difficult assignment; don’t panic, but work carefully and deliberately.
Please find another attachment for text book
Unit 1 D
After you have thoroughly read sections 11.1 – 11.3 in chapter 11 of Computer Science: An Overview. Answer the following questions:
https://eembdersler.files.wordpress.com/2010/09/computer_science_an_overview_11th1.pdf
1. Draw the search tree that is generated by a breadth-first search in an attempt to solve the eight-puzzle from the following start state without the assistance of any heuristic information. Continue the tree for 5 levels or until a solution is obtained.
| 1 | 3 | |
| 4 | 2 | 5 |
| 7 | 8 | 6 |
2. Draw the search tree that is generated by the best-fit algorithm below in an attempt to solve the eight-puzzle from the state shown in the first problem if the number of tiles out of place is used as a heuristic.
. Establish the start node of the state graph as the root of the search tree and record its heuristic value.
. While(the goal note has not been reached)do
2. [Select the leftmost leaf node with the smallest heuristic value of all leaf notes.
2. To this selected node attach as children those nodes that can be reached by a single production.
2. Record the heuristic of each of these new nodes next to the node in the search tree]
. Traverse the search tree from the goal node up to the root, pushing the production associated with each arc traversed onto a stack..
. Solve the original problem by executing the productions as they are popped off the stack.
· Draw the search tree that is generated by the best-fit algorithm as detailed in the previous question in an attempt to solve the eight-puzzle from the following start state, assuming the heuristic used is as follows: Measure the distance each tile is from its destination and add these values to obtain a single quantity.
| 1 | 2 | 3 |
| 5 | 7 | 6 |
| 4 | 8 |
· When solving the eight-puzzle, why would the number of tiles out of place not be as good a heuristic as the one described in the question above.
Do you need a similar assignment done for you from scratch? Order now!
Use Discount Code "Newclient" for a 15% Discount!
