Disclaimer: Dieser Thread wurde aus dem alten Forum importiert. Daher werden eventuell nicht alle Formatierungen richtig angezeigt. Der ursprüngliche Thread beginnt im zweiten Post dieses Threads.
Tuesday Morning Tutorial Thread
I have pushed this morning’s notebook to https://gl.kwarc.info/teaching/AI.
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.
I have pushed my notes on today’s Tutorial regarding MCTS and AlphaGo
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”.
Reminder: I am back from vacation so tomorrow’s tutorial will take place.
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.