Course talk:CPSC522/Knowledge Compilation

Hi Bahare, I found your page very informative, had a good flow and was easy to understand. I probably would’ve included some more examples to be able to understand the significance of terms like ‘consistency check’, ‘validity check’ , ‘sentential entailment check’. You could also consider putting your citations as links, so the user can easily navigate from your wiki to that page if need be. They can be included using [link the_word_that_you_want_to_link_it_to]. You could do the same for your annotated bibliography. Also linking up our peer’s wikipages to our pages provides a sort of overall picture of AI and helps put things in perspective. Thank you for writing about this since I had no previous exposure to knowledge compilation. Thanks for sharing this with us! Warm regards, Ritika

Hi Ritika,

Thanks for your comment. I edited some parts. Hope you like it.

Hi Bahare, Wenyi Wang, Mehrdad Ghomi
Great job on the page! It is very interesting. I loved the library example. I kind of got confused after DNNF, CNF and other acronyms. You might consider putting in some more examples or theory to explain. Like the other reviewers have mentioned it seems a bit concise considering students of all backgrounds. For example- In this "$i\neq j,Vars(C_{i})\cap Vars(C_{j})=\emptyset$ "- what is ars? Some definitions of the properties would be nice as well.

Nice work Bahare. The page is very nice with good examples. But the page seems to be too concise. It would be good if you could elaborate more on sd-DDNF and others. Further I agree with the suggestions that Ricky pointed out. Also the book example you gave is more theoretical and it would be good if you could rephrase that paragraph.

Hey Bahare,

Your page looks very neat, and the analogies in the introduction are great!

Some feedback:

- A couple things remain unclear to me: Is it possible to perform knowledge compilation from any boolean logic to any of the data structures you mentioned? Perhaps an algorithm of how to transform boolean expressions into DNNF could be helpful, if it's not too complicated. Or even just a very simple example with a few variables.

- What are the time complexities for performing compression using these data structures? (The act of creating a DNNF, for example.)

- The acronyms (NNF, DNNF) are used way before the acronym table. Do you think it's possible to move the table up, or not use these acronyms before they are explained? I don't believe these acronyms appear in any of the background links you've posted.

- Last thing: it seems your links are all broken because you forgot the colon after "https".

Thanks for the great read,

Ricky

---

• (5) The topic is relevant for the course.
• (5) The writing is clear and the English is good.
• (5) The page is written at an appropriate level for CPSC 522 students (where the students have diverse backgrounds).
• (5) The formalism (definitions, mathematics) was well chosen to make the page easier to understand.
• (5) The abstract is a concise and clear summary.
• (3) There were appropriate (original) examples that helped make the topic clear.
• (4) There was appropriate use of (pseudo-) code.
• (5) It had a good coverage of representations, semantics, inference and learning (as appropriate for the topic).
• (5) It is correct.
• (4) It was neither too short nor too long for the topic.
• (5) It was an appropriate unit for a page (it shouldn't be split into different topics or merged with another page).
• (5) It links to appropriate other pages in the wiki.
• (5) The references and links to external pages are well chosen.
• (5) I would recommend this page to someone who wanted to find out about the topic.
• (4.5) This page should be highlighted as an exemplary page for others to emulate.