Define the rule repeatN(LSTO, LST1, CNT). This rule determines when the list LST1 consists of only CNT repetitions of the contents of the singleton list LSTO. e.g.: |?- repeatN([a], A, 3). A = [a,a,a,a] ? yes |?- repeatN([a], [a,a,a,a], A). A = 3? yes |?- repeatN(A, [a,a,a,a], 3). A = [a] ? yes |?- repeatN([a,b], A, 1). no ?- repeatN(a, A, 1). no
Define the rule repeatN(LSTO, LST1, CNT). This rule determines when the list LST1 consists of only CNT repetitions of the contents of the singleton list LSTO. e.g.: |?- repeatN([a], A, 3). A = [a,a,a,a] ? yes |?- repeatN([a], [a,a,a,a], A). A = 3? yes |?- repeatN(A, [a,a,a,a], 3). A = [a] ? yes |?- repeatN([a,b], A, 1). no ?- repeatN(a, A, 1). no
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
Related questions
Question
pls write in prolog and answer with code, its better the show your test result also, thank you so much!
![Define the rule repeatN(LSTO, LST1, CNT). This rule determines when the list LST1 consists of
only CNT repetitions of the contents of the singleton list LSTO.
e.g.:
|?- repeatN([a], A, 3).
A = [a,a,a,a] ?
yes
|?- repeatN([a], [a,a,a,a], A).
A = 3?
yes
| ?- repeatN(A, [a,a,a,a], 3).
A = [a] ?
yes
| ?- repeatN([a,b], A, 1).
no
|?- repeatN(a, A, 1).
no](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8d929a48-f388-406c-ab99-8d714b815c4a%2Ffdb367d3-95f9-4f07-8713-26a646392bbc%2Fonwpapm_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Define the rule repeatN(LSTO, LST1, CNT). This rule determines when the list LST1 consists of
only CNT repetitions of the contents of the singleton list LSTO.
e.g.:
|?- repeatN([a], A, 3).
A = [a,a,a,a] ?
yes
|?- repeatN([a], [a,a,a,a], A).
A = 3?
yes
| ?- repeatN(A, [a,a,a,a], 3).
A = [a] ?
yes
| ?- repeatN([a,b], A, 1).
no
|?- repeatN(a, A, 1).
no
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 6 steps
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.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