Knowledge Representation and Reasoning Seminar

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Knowledge Representation and Reasoning Seminar

Lehrveranstaltung mit SWS 0/2/0 (Vorlesung/Übung/Praktikum) in SS 2016

Dozent

Umfang (SWS)

  • 0/2/0

Module

Leistungskontrolle

  • Mündliche Prüfung
  • Referat


Satisfiability Testing (SAT)

This years seminar is all about recent research related to SAT solving.

The student has to select a topic from the ones listed below. He has to study the respective literature. The students are expected to participate in the seminar, write a short report of the assigned topic, and give a presentation in the end of the summer term. The presentation should have a length of 30 minutes, followed by a 15 minutes discussion.

German students can give the presentation also in German.

For the students who want to participate at the KRR Seminar it is mandatory to attend all talks during the term. The report (five pages) and the slides have to be send one week before the presentation to Peter Steinke.

Topics

Schedule

The seminar meetings take place on Mondays, from 16.40 to 18.10 (DS 6) in room E05.

  • 04.04. initial meeting
  • 11.04. Christoph Wernhard on "Towards Knowledge-Based Assistance for Scholarly Editing" (joint work with Jana Kittelmann)
  • 18.04. Emmanuelle Dietz on "Response Patterns and Selection Sequences in the Wason Selection Task" (joint work with Marco Ragni and Ilir Kola)
  • 25.04. Ebrahim Zidan on the paper "Abduction for Discourse Interpretation: A Probabilistic Framework"
  • 09.05. Sibylle Möhle on "Better Evaluations by Analyzing Benchmark Structure" (joint work with Norbert Manthey)
  • 16.05. Pfingsten
  • 23.05. Timo Richter "Pseudo-Boolean-Constraints effizienter lösen" (in German language)
  • 30.05. Luis Palacios Medinacelli "A full Network Specification of Skeptical Abduction"
  • 06.06. Tobias Philipp "The Pythagorean Triples Problem - 200 Terabytes of Proofs"
  • 13.06. Walter Forkel "Towards a Mechanically Verifiable and Efficient RUP Checker" and Anatoly Zelenin "Towards a Mechanically Verifiable Preprocessor for SAT"
  • 20.06. Tobias Philipp "Certificates for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing"