Answered: Prolog | bartleby

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Consider the following Prolog program: edge(a, b). edge(c, d). edge(a, c). edge(c, b). edge(X, Y) :- edge(Y, X). path(X, X). path(X, Y) :- edge(Z, Y), path(X, Z).

Note that this program is nearly identical to one presented in lecture except for the inclusion of the extra rule:

edge(X, Y) :- edge(Y, X).

The intent is that, with this additional rule, the program should model an undirected (as opposed to directed) graph.

(a) Execute the query: ?- edge(a,b). What response do you get?

(b) Execute the query ?- edge(b,a). What response do you get?

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions