Answered: Consider the following Prolog facts and…

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 facts and rules:
insert(X, L, [X|L]).
insert(X, [H|L], [H|L1]) :- insert(X, L, L1).
permute([], []).
permute([H|T], P) :- permute(T, P1), insert(H, P1, P).
Draw the Prolog trees corresponding to the following queries; show the rule and substitution used
at each step:
(a)
?- permute([a,b], Y).
Y = [a, b] ;
Y = [b, a] ;
false.
(b) Show the part of the tree with solutions and explain why the tree is infinite:
?- permute(Y, [a,b]).
Y = [a, b] ;
Y = [b, a] ;
...
(c) Explain the effect of the cut in the tree.
?- not(permute(Y, [])).
false.

Expert Solution

Step by step

Solved in 3 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