Prolog – Sorting Hat Challenge

hogwarts-sorting-hatProlog is a language built around the Logical Paradigm: a declarative approach to problem-solving.

There are only three basic constructs in Prolog: facts, rules, and queries.

A collection of facts and rules is called a knowledge base (or a database) and Prolog programming is all about writing knowledge bases. That is, Prolog programs simply are knowledge bases, collections of facts and rules which describe some collection of relationships that we find interesting.

So how do we use a Prolog program? By posing queries. That is, by asking questions about the information stored in the knowledge base. The computer will automatically find the answer (either True or False) to our queries.


Knowledge Base (Facts & Rules)

Check the following knowledge base used by the Sorting Hat in the Harry Potter story:

Note that \+ means NOT


We can now query this database. For each of the queries listed below, what do you think the computer will return?

True or False Queries:

Other Queries:

Task #1: Try It Online

Test all of the above queries online to see what they return:

Task #2: Griffindor or Ravenclaw?

Can you add a few more facts for a student called “Cho-Chang” who would meet all the requirements to belong to both Griffindor and Ravenclaw.

As a student should only belong to one house, update the rule for belongToRavenclaw() to make sure this rule only returns True for students who are curious but do not already belong to Griffindor.

Extension Task:

Add a few facts and rules to this knowledge base. Create your own queries using the new facts and rules you have added.

Did you like this challenge?

Click on a star to rate it!

Average rating 5 / 5. Vote count: 2

No votes so far! Be the first to rate this post.

As you found this challenge interesting...

Follow us on social media!

Tagged with: