Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

(a) Imagine that the following PROLOG knowledge base describes a maze. The facts determine which points are connected, i.e., from which point you can get

image text in transcribed

(a) Imagine that the following PROLOG knowledge base describes a maze. The facts determine which points are connected, i.e., from which point you can get to which other point in one step. Furthermore, imagine that all paths are one-way streets, so that you can only walk them in one direction. So, you can get from point 1 to point 2, but not the other way round. connected(1,2) connected(3,4) connected(5,6) connected(7,8) connected(9,10) connected (12,13) connected(13,14) connected (15,16) connected(17,18) connected (19,20) connected(4,1) connected(6,3) connected(4,7) connected(6,11) connected(14,9) connected (11,15) connected (16,12) connected (14,17) connected (16,19) Write a predicate path/2 that tells you from which point in the maze you can get to which other point when chaining together connections given in the above knowledge base

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Semantics Of A Networked World Semantics For Grid Databases First International Ifip Conference Icsnw 2004 Paris France June 2004 Revised Selected Papers Lncs 3226

Authors: Mokrane Bouzeghoub ,Carole Goble ,Vipul Kashyap ,Stefano Spaccapietra

2004 Edition

3540236090, 978-3540236092

More Books

Students also viewed these Databases questions