1. (10 points) This is a classical Prolog application. Given the following graph of possible flights between eight US cities: New York Chicago $75 San Francisco $25 $20 $75 $100 $45 $100 Denver $125 $90 LA $80 Dallas $45 $90 San Diego $50 Miami a) Build a knowledge base using the predicate directFlight/2 which encodes one city has direct flight to another city. b) Add to rule that checks if there is a route between two cities. Routes of length zero are allowed. Example queries: route(chicago, chicago). should return yes. route (chicago,la). should return yes. route (la,'San Fracisco'). should return no. c) Add a rule that checks if a route has two legs. route of 2 legs(chicago,la). should return yes route of 2 legs(chicago,denver). should return no Example queries: d) (optional, 3 extra points)Add cost factor to directFlight, route, and route of 2 legs so that the knowledge base can tell the cost associated with each flight. For example, route(chicago, X, Y). tells all the cities reachable from Chicago, and the cost (Y)to fly from Chicago to each city (X).

1. (10 points) This is a classical Prolog application. Given the following graph of possible flights between eight US cities: New York Chicago $75 San Francisco $25 $20 $75 $100 $45 $100 Denver $125 $90 LA $80 Dallas $45 $90 San Diego $50 Miami a) Build a knowledge base using the predicate directFlight/2 which encodes one city has direct flight to another city. b) Add to rule that checks if there is a route between two cities. Routes of length zero are allowed. Example queries: route(chicago, chicago). should return yes. route (chicago,la). should return yes. route (la,'San Fracisco'). should return no. c) Add a rule that checks if a route has two legs. route of 2 legs(chicago,la). should return yes route of 2 legs(chicago,denver). should return no Example queries: d) (optional, 3 extra points)Add cost factor to directFlight, route, and route of 2 legs so that the knowledge base can tell the cost associated with each flight. For example, route(chicago, X, Y). tells all the cities reachable from Chicago, and the cost (Y)to fly from Chicago to each city (X).

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

define Substring method.
Define assignment operator.
Programming homework1) Simulated waiting queue in an Indian post office: In an Indian post office that not only distributes mail but also performs some financial activities like a savings bank, a lone postal worker attends to a single lineup of clients. As soon as a consumer enters the line, they are given a token # (serial number). After receiving assistance, the consumer exits the queue while the postal worker receives the token back. The employee could inquire as to how many consumers are still unattended at any one time.i) Put the system into practise using a suitable queue data structure, simulating the arrival and departure of consumers at random when the service is finished.
3. Let S(x) be the statement "x studied for the exam" and H(x, y) be the statement "x scored higher than y in the exam," where the domain of x and y consists of all students in this class. Which logical expression corresponds to the following statement? "Every student in this class who studied for the exam scored higher in the exam than every student who did not study for the exam." a. VxVy (H (x, y) → (S(x) ^ ¬S(y))) b. VxVy(S(x)^¬S(y) ^ H (x, y)) c. VxVy((S(x) ^ ¬S(y)) → H (x, y)) d. VxVy((S(x) → ¬S(y)) → H (x, y))
There are no limitations on the implementation of an overloaded operator. Falsely Precise