prolog

Consider the following knowledge base: Interpretation of nonStopFlight(x,y) is that there is a to-and-fro flight connection between airport x and y. nonStopFlight(la, chicago) nonStopFlight(philadelphia, la). nonStopFlight(columbus, philadelphia) nonStopFlight(sanFrancisco, columbus). nonStopFlight(detroit, sanFrancisco) nonStopFlight(toledo, detroit) nonStopFlight(houston, sanFrancisco). Write a recursive rule find Flight/2 that tells us whether there is a flight route from one town A to an-other town B. Run at least 3 querries (one with at least 2-hop route, one with one-hop route, one with noroute) and show the answers Consider the following knowledge base: Interpretation of nonStopFlight(x,y) is that there is a to-and-fro flight connection between airport x and y. nonStopFlight(la, chicago) nonStopFlight(philadelphia, la). nonStopFlight(columbus, philadelphia) nonStopFlight(sanFrancisco, columbus). nonStopFlight(detroit, sanFrancisco) nonStopFlight(toledo, detroit) nonStopFlight(houston, sanFrancisco). Write a recursive rule find Flight/2 that tells us whether there is a flight route from one town A to an-other town B. Run at least 3 querries (one with at least 2-hop route, one with one-hop route, one with noroute) and show the answers