this playlist of prolog is surprisingly well made. there aren't many videos about prolog and, if there are, they are not very good. most shocking part is that this is from 10 years ago and has better quality than many other tutorials done recently.
so many programming videos are made by people who can't speak english well (if at all) and/or can't explain it well at all. it's nice to find someone who speaks clearly and explains things simply and efficiently. love the videos man, they're really helping me!
Please give part 5,I am gonna watch part 4 now and I know I will want part 5 after watching it. It gives a feeling like watching a film series,very addictive.
Hey. Really enjoying your videos. They're greatly helping me understand Prolog for my Final Year Project. Just interested if you will be doing anymore of them. Thanks!
I have been scouring the youtube for past 3 days for prolog programming tutorial video. This is one of the finest I have found till date. Effective, precise and right on to the point. BTW where is that part 5 video. You have been teasing the recursion function since part 3. :) Keep up the good work.
4 years has already past but still there's no part 5.. What may be the reason for it since in part 4 the speaker himself mentions to include more in part 5 and so on?
Maybe he changed his mind,I am going to start watching the fourth one now,but I feel sad , everyone ask for a part 5 in the comments.I will need a part 5 after watching too.He just finish it like in a film series,giving a to be continued feeling.I do not feel time going when I listen to it.Its 3:40 a.m ,but I feel wide awake.
I just don't get the last part, why is H=2? I mean yeah sure I know a dolar is 2 H but what piece of this code says that? it's a list and you're using member rule so it should output all the options which are 0,1,2 right? I mean how does it calculate how many H's and the rest?
i have a problem here. suppose i have several points connected with one and other. I need to use member and list function to figure out the order of how they are connected. It involves recursion as well. connected(1,2). connected(2,1). connected(1,3). connected(3,1). connected(4,2). connected(4,5). connected(5,6). member(X, [H|T]). member(X, [H|T]):- member(X, T). path(X, Y) = connected(X, Y), not(member(X, Y)) path(X, Y, V) = connected(X, Y), not(member(X, V) I dunno how to write next to get the results.
how do i print the elements of a list inside a list? For example, if i have a list print_list([[b,c,f],[a,d,g],[h,e]]), i want the output to be |b|c|f|a|d|g|h|e
How can I "normalize" last code in this video replacing lists [1,..,20] by some nested rule generating this lists ? Factically I want not _rule_, but _function_ here, and my imperative habits brokes my mind on groking Prolog in this cases. I spend lot of time trying to grok prolog approach and still far from this goal 8-(
Hi I wanted to know, how I can print out unique values from a database, so say for instance. This is what I have been trying. But the problem I have is that it does not actually remove the dupliactes. This is the predicate to remove duplicates deleteCopies([], []). deleteCopies([H|T], [H|T1]) :- subtract(T, [H], T2), deleteCopies(T2, T1). and this is how I created the predicate to print out unique values from the list below isDoggy([]). isDoggy([H|T]):- dog(H,_,_), deleteCopies([H|T], [H|T1]), isDoggy(T1). dog('Fred',2001,2003). dog('Barky',2003,2005). dog('Fred',2005,2007). dog('Ben',2007,2009). dog('Barky',2009,2011). dog('Tom',2011,2013).
You tutorials are very helpful to me than what I'm learning in class. I am still struggling with list homework, recursively define rules/functions. can you make a video that covers deepsearch, for example, member(4,[2,3,[3,5,[4,5],6],7]) should return true which currently is false because the built-in member() function only supports first level membership check. Yet another recursive problem dealing with converting a lists to integers, add the results then output a list from the result. For example, sum([2,2,2,2],[3,3,3],X) => X = [2,5,5,5] because 2222+333 = 2555. How do you use a result from a sub function as a parameter to another? Like sum(2,2,X) => X =4 but now how do use the value of X in another function?.I hope you respond sooner to this post. Thanks.
You funny guy. You indeed a simple engineer. Were you even aware that your prolog videos are the best on the net till now. But just like for all your playlists - incomplete. Did someone kill you ??
this playlist of prolog is surprisingly well made. there aren't many videos about prolog and, if there are, they are not very good. most shocking part is that this is from 10 years ago and has better quality than many other tutorials done recently.
Im waiting for part 5 like I'm waiting for my dad to get back from buying cigarettes
good luck with that
so many programming videos are made by people who can't speak english well (if at all) and/or can't explain it well at all. it's nice to find someone who speaks clearly and explains things simply and efficiently. love the videos man, they're really helping me!
+pAWNproductionsDE glad to have helped!
+The Simple Engineer please do a part 5 ill pay
yes please. especially on recursion
the video is perfecT XDDD
Disappointed there's no part 5, these videos are great!
+LanOfLight They're quite basic indeed.
Please continue the tutorials! they are great
Please give part 5,I am gonna watch part 4 now and I know I will want part 5 after watching it. It gives a feeling like watching a film series,very addictive.
An awesome short video tutorial series on Prolog basics. Keep up the good work!
I wish you published the recurrsion tutorial :'(
Hey. Really enjoying your videos. They're greatly helping me understand Prolog for my Final Year Project. Just interested if you will be doing anymore of them. Thanks!
Excellent! Very useful, looking forward to part 5
urgently neeeeeeeeed part 5 ... writing exam in few weeks. thank you! danke.
rip
F
F
i am from taiwan, my english is poor, however, the speaker makes it real simple that i could understand as well, thank you~~
Great videos!! I found them very useful, I hope you make the fifth tutorial!
I have been scouring the youtube for past 3 days for prolog programming tutorial video. This is one of the finest I have found till date. Effective, precise and right on to the point. BTW where is that part 5 video. You have been teasing the recursion function since part 3. :) Keep up the good work.
2022 and this video is still awesome, thanks
Please continue the tutorials! They are really good and I don't understand recursion. Help :)
Are you publishing the next tutorial? I hope you do.. they are very good!
Great tutorials, keep it up. It helped a lot!!!
Fantastic, just what I was looking for!
Cool, glad you enjoyed!
This was big help, thanks man, keep it up!
Sir can you please tell me how can i delete even numbers from a list? And sort the list in ascending order. Thanks.
Aren't you going to complete the tutorial ?
It's really helpful, wish you continue it :/ .
looking forward to part 5!)
Do you have plans to continue on wrting computer languaga processing in Prolog lije parsing and writing tiny compilers/asemblers?
this video gonna make my exam awesome
We need more please ^^
thank you so much!! helped me a lot :) would be happy if you could do part 5 and more.. i still have troubles with recursive functions
I found this very useful but I hope to see more in next video :)
4 years has already past but still there's no part 5.. What may be the reason for it since in part 4 the speaker himself mentions to include more in part 5 and so on?
Maybe he changed his mind,I am going to start watching the fourth one now,but I feel sad , everyone ask for a part 5 in the comments.I will need a part 5 after watching too.He just finish it like in a film series,giving a to be continued feeling.I do not feel time going when I listen to it.Its 3:40 a.m ,but I feel wide awake.
Please, continue this tutorials!!
how to concatenate two list and make third list ????
I am waiting for the part 5
I am getting singleton variable error if i m not declaring T n H
member(X,T [X|T]).
member(X,H [H|T]):-
member(X,T).
put _ on T n H place
great series
I just don't get the last part, why is H=2? I mean yeah sure I know a dolar is 2 H but what piece of this code says that? it's a list and you're using member rule so it should output all the options which are 0,1,2 right? I mean how does it calculate how many H's and the rest?
Thanks dude.
It's awesome!!
Will you update a new chapter?
Thank you man very much
please continue :)
very nice ! and can you tell me the name of the song 00:00
Thanks man is an incredible video! very helpful!!
2021 and still no part 5 :/
Thank you, this was very helpful!
My pleasure
Good job man!
RIP this is the end of the tutorials
Wont u create more videos?
Very helpful, thanks!
can i contact you please ?
Thanks you!
Part 5 Recursion pls!
Very nice indeed.
i have a problem here. suppose i have several points connected with one and other.
I need to use member and list function to figure out the order of how they are connected. It involves recursion as well.
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,1).
connected(4,2).
connected(4,5).
connected(5,6).
member(X, [H|T]).
member(X, [H|T]):- member(X, T).
path(X, Y) = connected(X, Y), not(member(X, Y))
path(X, Y, V) = connected(X, Y), not(member(X, V)
I dunno how to write next to get the results.
Thanks a lot! XD
wtf dude -.- please continue!
Hope that all is well wherever you are, really enjoying your videos, but where is video five.
Especially on the point of recursive functions
Please keep on doing :)
Watched all 4 Tutorials ?
is there more ?
if not do you have any recommendations on where I should properly learn prolog ?
how do i print the elements of a list inside a list? For example, if i have a list print_list([[b,c,f],[a,d,g],[h,e]]), i want the output to be |b|c|f|a|d|g|h|e
That last part was pretty funny. "Pennies... uh... uh... actually we're not going to include this."
thank you!!! maybe i'll pass my exam tomorrow ...
thank you so much
what about part 5 man ?
Still waiting part 5
Cool vids, thanks
can you explain more on recursion please
Hey your next video??
How can I "normalize" last code in this video replacing lists [1,..,20] by some nested rule generating this lists ?
Factically I want not _rule_, but _function_ here, and my imperative habits brokes my mind on groking Prolog in this cases. I spend lot of time trying to grok prolog approach and still far from this goal 8-(
I went to the site but ''Create a new program or notebook here '' Which should I use?
hello, can you tell me why this example gives a false answer:
[a, b, c|rest] = [1, 2, 3, 4, 5].
You should write letters a, b, c and rest with uppercase, because it's variables
anyone know how I can get pairs of a list , let's say I have a list of : [1,2,3]
the result would be : [[1,2],[1,3],[2,3]].
thnx very much
yo nice
whats the name of the track
Hi I wanted to know, how I can print out unique values from a database, so say for instance. This is what I have been trying. But the problem I have is that it does not actually remove the dupliactes.
This is the predicate to remove duplicates
deleteCopies([], []).
deleteCopies([H|T], [H|T1]) :- subtract(T, [H], T2), deleteCopies(T2, T1).
and this is how I created the predicate to print out unique values from the list below
isDoggy([]).
isDoggy([H|T]):- dog(H,_,_), deleteCopies([H|T], [H|T1]), isDoggy(T1).
dog('Fred',2001,2003).
dog('Barky',2003,2005).
dog('Fred',2005,2007).
dog('Ben',2007,2009).
dog('Barky',2009,2011).
dog('Tom',2011,2013).
Next part?
You tutorials are very helpful to me than what I'm learning in class. I am still struggling with list homework, recursively define rules/functions. can you make a video that covers deepsearch, for example, member(4,[2,3,[3,5,[4,5],6],7]) should return true which currently is false because the built-in member() function only supports first level membership check. Yet another recursive problem dealing with converting a lists to integers, add the results then output a list from the result. For example, sum([2,2,2,2],[3,3,3],X) => X = [2,5,5,5] because 2222+333 = 2555. How do you use a result from a sub function as a parameter to another? Like sum(2,2,X) => X =4 but now how do use the value of X in another function?.I hope you respond sooner to this post. Thanks.
Nice Video..... But where is the next video?
Can you please put up a tutorial for finding Maximum value from our database of facts?
You funny guy. You indeed a simple engineer. Were you even aware that your prolog videos are the best on the net till now. But just like for all your playlists - incomplete. Did someone kill you ??
Still alive ;)
@@TheSimpleEngineer Then pleeease make more videos. I need to learn Prolog. I can fund you
excellent tutorial, but no pairs explained......
sad that there is no part 5
wanted to understand recursive rules better
year 2017
still no part 5
ANY P5?
dudes where is the next video?
where is part5?
You misspelled 'Cents' with a S
i want to see mroe Videos please make soem when yo have time :S
dead(z) made me instantly think of Pulp Fiction
so sad theres not part 5 u_u
May be I am dumb but i heard penis when you was saying ("Penns" or "pen is") =))))) - funny
dead(z) baby...dead(z)
Thank you so much