Knowledge Representation and Reasoning Seminar (WS2016): Unterschied zwischen den Versionen
Peter Steinke (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Peter Steinke (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 46: | Zeile 46: | ||
==Schedule== | ==Schedule== | ||
* <b>17.10. | * <b>17.10. <i>initial meeting</i></b> | ||
* <b>24.10.</b> <i>Formalization and Certification of Parallel SAT Solvers </i> by Tobias Philipp | * <b>24.10.</b> <i>Formalization and Certification of Parallel SAT Solvers </i> by Tobias Philipp | ||
* <b>31.10.</b> <i>Reformationstag</i> (official holiday) | * <b>31.10.</b> <i>Reformationstag</i> (official holiday) | ||
* <b> 7.11.</b> <i>Encoding Pseudo-Boolean Constraints into CNF</i> by Peter Steinke | * <b> 7.11.</b> <i>Encoding Pseudo-Boolean Constraints into CNF</i> by Peter Steinke | ||
}} | }} | ||
Version vom 21. Oktober 2016, 10:15 Uhr
Knowledge Representation and Reasoning Seminar
Lehrveranstaltung mit SWS 0/2/0 (Vorlesung/Übung/Praktikum) in WS 2016
Dozent
- Steffen Hölldobler
- Peter Steinke
Umfang (SWS)
- 0/2/0
Module
Leistungskontrolle
- Mündliche Prüfung
- Referat
Satisfiability Testing (SAT)
The seminar meetings take place on Mondays, from 16.40 to 18.10 (DS 6) in room E05. The initial meeting will take place on Monday 17.10.
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
- Speeding up MUS Extraction with Preprocessing and Chunking
- Authors: Valeriy Balabanov and Alexander Ivrii
- Laissez-Faire Caching for Parallel #SAT Solving
- Authors: Jan Burchard , Tobias Schubert and Bernd Becker
- #∃SAT: Projected Model Counting
- Authors: Rehan Abdul Aziz, Geoffrey Chu, Christian Muise and Peter Stuckey
- Using Community Structure to Detect Relevant Learnt Clauses
- Authors: Carlos Ans ́otegui, Jes ́us Gir ́aldez-Cru, Jordi Levy and Laurent Simon
- Exploiting Resolution-based Representations for MaxSAT Solving
- Authors: Miguel Neves, Ruben Martins, Mikoláš Janota, Inês Lynce and Vasco Manquinho
- Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
- Author: Chanseok Oh
- A New Approach to Partial MUS Enumeration
- Authors: Christian Zielke and Michael Kaufmann
- Evaluating CDCL Variable Scoring Schemes
- Authors: Armin Biere and Andreas Fröhlich
Schedule
- 17.10. initial meeting
- 24.10. Formalization and Certification of Parallel SAT Solvers by Tobias Philipp
- 31.10. Reformationstag (official holiday)
- 7.11. Encoding Pseudo-Boolean Constraints into CNF by Peter Steinke
