Not logged in. · Lost password · Register

 Member since Nov 2018 53 posts 2019-11-12, 11:07   #1   Subject: Tuesday Morning Tutorial Thread I have pushed this morning's notebook to https://gl.kwarc.info/teaching/AI.
 Member since Nov 2018 53 posts 2019-11-19, 10:43   #2   I have uploaded the slides from today's tutorial. As some of you did not know: Reference solutions for the assignments are always posted at https://kwarc.info/teaching/AI/ after the deadline has expired.
 Member since Nov 2018 53 posts 2019-11-26, 10:30   #3   I have pushed my notes on today's Tutorial regarding MCTS and AlphaGo
 Member since Nov 2018 53 posts 2019-12-17, 15:48   #4   This morning I could not quite come up with an example of a fragment of propositional logic that is decidable in polynomial time. What I intended was HORNSAT which is satisfiability over the set of Horn clauses defined as the disjunctive normal form formulas that have only one positive (not-negated) literal, i.e. "a or not b or ... not c". Horn formulas are arbitrary (including unary) conjunctions of horn clauses. There are linear algorithms to decide whether a given Horn-formula is satisfiable, so HORNSAT is in P. You might want to note that using equivalence between "not a or b" and "a => b" the above horn clause can be rewritten as  b and ... and c => a, or in Prolog notation "a :- b, ..., c".
 Member since Nov 2018 53 posts 2020-01-20, 10:20   #5   Reminder: I am back from vacation so tomorrow's tutorial will take place.
 Member since Nov 2018 53 posts 2020-02-03, 14:07   #6   Tomorrow's tutorial will (mostly) be dedicated to any questions you might have before the exam on 10th. If you have the time, please email me your questions by tonight, then I can prepare for them a bit. Otherwise just ask them tomorrow.
Close Smaller – Larger + Reply to this post:
Verification code: Please enter the word from the image into the text field below. (Type the letters only, lower case is okay.)
Smileys:
Special characters:
Go to forum
Datenschutz | Kontakt