Prolog-Course-and-Extracurricular-Activities-Suggestions-

Forward Chaining refers to that we are given a set of facts and we try to derive conclusions from these facts. durable-rules refer to defining the event, fact pattern to match and the action to take.

Algorithm Design:

The overview of the whole system is as follows:
Given: Interest of the student, grade of the student
Output: The suggestion list of courses and extracurricular activities

Process:

There is 4 ruleset that is used that is ‘interests’, ‘basic courses’, ‘courses’, ‘activities’.
1. The student is first asked to enter the current grade as an input which lies between 1 to 10.
2. A list of interests related to the courses and a list of interests of non-technical activities is being displayed to the student, in which the student enters the index choice which takes the value of it from the stored dictionary.

Dictionary which stores the mapping of the index with the interest. interest_dict = {1:'machine learning', 2:'deep learning', 3:'data engineering', 4:'software development', 5:'computer vision', 6:'algorithms', 7:'animation', 8:'speechaudio', 9:'cybersecurity', 10:'wirelesscommunication', 11:'vlsi', 12:'csp', 13:'bio', 14:'psychology' }

Dictionary which stores the mapping of the index with the non-technical activity interest. extracurricular_dict = {1:'astronomy', 2:'audio', 3:'literature', 4:'theatre', 5:'dance', 6:'standup', 7:'photography', 8:'finance', 9:'art', 10:'fashion'}

3. After the student has entered valid indexes, then for courses interest, the ‘interests’ ruleset is called and then the matched facts according to the interest and the grade is being triggered. This is the repeated application of logical modus ponens to the set of facts being called to derive a conclusion. The basic courses and core/elective courses ruleset are being called and ‘activities ruleset which displays the technical club.

4. For the non-technical interest choice, the fact calls the ‘activities’ ruleset which matches the set of facts/events present inside and then calls the set of facts present inside that matched function.

How Forward Chaining Displayed:

Since the student is asked the interest of its choice and the fact is generated, assert_fact('interests', {'interest':interest_value, 'grade':grade}). This fact calls the ‘interests’ ruleset and then matches that is following the logical modus ponens, where p = initial fact generated above/ matched function with this fact, q = facts written inside the matched function of ruleset if exists, then it calls q. So, this q is followed by here as ‘basic courses’, then ‘courses’ and then technical ‘activities’. This process repeats to the sets of facts being called to derive the conclusion. Then, concluding courses facts(goal) are displayed from all the ruleset. SImilarily for the extracurricular activities, the fact generated from the user choice is assert_fact('activities', {'club':interest_value_1}). This fact calls the ‘activities ruleset and then matches that is also following the logical modus ponens, where p = initial fact generated above/ matched function with this fact, q = facts written inside the matched function of the ruleset if exists, then it calls q. This process repeats to the sets of facts being called to derive the conclusion. So, it lists out all the extracurricular clubs/activities present in IIITD to the student, which is the goal.

Modus Ponens:

p
If p then q
--------------
q
Hence, this is how forward chaining is shown here, that is given from the set of facts and we try to derive conclusions from these facts.

Input-Output:

Given Input Initial Facts:

assert_fact('interests', {'interest':interest_value, 'grade':grade})
assert_fact('activities', {'club':interest_value_1})
Here, interest_value = Course related interest input by student
Grade = Input grade by user
interest_value_1 = Extra Curricular related interest input by student

Output:

Concluding Facts related to the list of courses and extracurricular activities based on interest.
For Example, for some valid course interest - ‘algorithms’, grade - 8, and non-technical interest - ‘finance’.

Concluding Output obtained facts after Forward Chaining:
Fact: Choose Foundation Course - Analysis and Design of Algorithms
Fact: Choose Foundation Course - Data Structures and Algorithms
Fact: Choose Elective Course - Introduction to Graduate Algorithms
Fact: Choose Elective Course - Program Verification and Analysis
Fact: Choose Elective Course - Algorithms in Computational Biology
Fact: Choose Elective Course - Randomized Algorithms
Fact: Choose Elective Course - Modern Algorithm Design
Fact: Technical Club Foobar:- Competitive Programming Club
Fact: NonTechnical Club Finnexia:- Finance Club

Screenshots: