1.Consider the following Prolog facts and rules:member (X, (X|_]).member (X, [_T]) :- member (X, T).subset ((), _).subset([HT], S) :- member (H, S), subset (T, S).(a)(b)Draw the Prolog tree corresponding to the following query:?- subset([a,b], [a,b,a]).true ;true ;false.There are 7 possible places to insert a single cut (!) in the set of axioms, marked belowby [1]-[7]:member (X, (✗|_]) :- ![1].member (X, [_[T]) :- ![2], member (X, T), ! [3].subset ((), ) :- ! [4].subset([HT], S) :- ![5], member(H, S), ! [6], subset (T, S), ! [7] .Which of these cuts are causing a unique solution as shown below? (You are using a singlecut at a time.)? subset1 ([a,b], [a,b,a]).true.Explain the role of each cut by showing what parts of the tree it removes.

To sum up, the well-placed breaks in the Prolog rules help to streamline the search and guarantee…

Answered: 1. Consider the following Prolog facts…

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

Similar questions

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 usedat 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.
(20 Points) Consider the following grammars where S is the start symbol and a, b, and c are terminal symbols and A, B, and C are non-terminal symbols.S ---> aA | bB | cCA --> aA | aB | aB --> bB | bC | bC --> cC | cExplain in your own words what the grammar generates. Which of the following sentences are in the language generated by the grammar? Show derivations. If a sentence cannot be generated by the grammar, explain why abcabcab aaaaaabb cccccaaaa bbbbbbbc aaaaaaccc
Write prolog query: closest_common_ancestor. x is a closest common ancestor of two people y and z if x is an ancestor of both y and z and no child of x is an ancestor of y and z. (A closest common ancestor of two ?rst cousins will be someone who is a grandparent of both.) first_cousin(C1,C2):- parent(P1,C1), parent(P2,C2), sibling(P1,P2). grand_parent(GP,GC):- parent(GP,P), parent(P,GC).
answer the following and explain Establish that L is context-free by building a CF grammar for L = {0n1m: n does not equal 4m and n,m ≥0}
Suppose a Prolog database exists that gives information about a family. Predicates of male, female, and parentof are included.a. Formulate a rule to define fatherof.b. Formulate a rule to define daughterof.c. Formulate a recursive rule to define ancestorof.
Please create a CKY table for each of the remaining sentences. Given grammar is: S -> NP VP NP -> 'I' | 'Texas' | 'South Padre' | 'hotel' | 'beach' | 'view' | 'sunrise' | 'vacation' | 'boat' | 'water' | 'trip' | 'waves' | 'speed' VP -> 'want' 'to' V | 'like' NP | 'Go' 'to' NP | 'Get' 'a' NP | 'On' 'the' NP | 'Love' 'the' NP | 'Book' 'a' NP | 'Need' 'this' NP | 'Prefer' 'the' NP | 'enjoy' NP V -> 'travel' | 'swim' | 'be' Waves are high Prefer the boat I enjoy speed
In Example 6.1, show a derivation tree for the string ababbac, using both the original and the modified grammar. EXAMPLE 6.1 Consider G = ({A, B}, {a, b, c}, A, P) with productions A→a|aaA|abBc,B→abbA|b.A→a|aaA|abBc,B→abbA|b. Using the suggested substitution for the variable B, we get the grammar Ĝ with productions A→a|aaA|ababbAc|abbc,B→abbA|b.A→a|aaA|ababbAc|abbc,B→abbA|b. The new grammar Ĝ is equivalent to G. The string aaabbc has the derivation A ⇒ aaA ⇒ aaabBc ⇒ aaabbc in G, and the corresponding derivation A ⇒ aaA ⇒ aaabbc in Ĝ. Notice that, in this case, the variable B and its associated productions are still in the grammar even though they can no longer play a part in any derivation. We will next show how such unnecessary productions can be removed from a grammar.
Using the Language Prolog, Does [[A|B], C] match with [mineDog,loneStar,greenCat]
Let G = ( V, T, S, P ) be the grammar with V = { a, b, c, S }, T = { a, b, c } and the set P of productions S →1 abS, S →2 bcS, S →3 bbS, S →4 a, S →5 cb. Construct derivation trees for the following strings. A. bcbba B. bbbcbba C. bcabbbbbcb
2. Is it possible for a regular grammar to be ambiguous? If yes, please show an example case.
Grammar and its application to FractalsLet G=(N,T,P,∑) where ∑ is the start symbol, N = {D}, T = {d, r, l}, andP = {∑→D, D→DrDllDrD, D → d} 1. Give the most specific type of grammar G.2. Show the leftmost derivation sequence of the string drdlldrd, (i.e. When deriving a new sentential form, always replace one Nonterminal at a time and always replace the leftmost Nonterminal)3. Suppose d is an abstraction of a command to draw a straight line of fixed length in the current direction, r is an abstraction of a command to turn right by 60 degrees, and l is an abstraction of a command to turn left by 60 degrees. Assuming that you are to start from a point and that the starting direction is to proceed horizontally to the right, show the figure represented by the generated string drdlldrd.4. The string drdlldrdrdrdlldrdlldrdlldrdrdrdlldrd can also be generated. Assuming that you are to start from a point and that the starting direction is to proceed horizontally to the right, show the figure…
Consider the grammar G = ({S, A}, S, {a, b}, P) with the following set of production rules P: S → aS|baA|abaAA → aAbb|aAb|ε 1. Determine what the language generated by G is. You may only use set builder notation and/or language operators in your answer. A proof is not required. 2. Show that the grammar G is ambiguous by: (a) Providing two distinct leftmost derivations for the same string w ∈ L(G).(b) Providing two distinct parse trees for the same string w ∈ L(G).

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS