Account
Edit tools
Intern
SucheSearch
English

Knowledge Representation and Reasoning Seminar (SS2016): Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Peter Steinke (Diskussion | Beiträge)
Keine Bearbeitungszusammenfassung
Peter Steinke (Diskussion | Beiträge)
Keine Bearbeitungszusammenfassung
 
(2 dazwischenliegende Versionen von 2 Benutzern werden nicht angezeigt)
Zeile 10: Zeile 10:
|SWSPractical=0
|SWSPractical=0
|Exam type=mündliche Prüfung, Referat
|Exam type=mündliche Prüfung, Referat
|Description===Satisfiability Testing (SAT)==
|Description===Schedule==
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==
 
* [http://rd.springer.com/chapter/10.1007/978-3-319-24318-4_3 Speeding up MUS Extraction with Preprocessing and Chunking]
** Authors: <i>Valeriy Balabanov and Alexander Ivrii</i>
* [http://rd.springer.com/chapter/10.1007%2F978-3-319-24318-4_5 Laissez-Faire Caching for Parallel #SAT Solving]
** Authors: <i>Jan Burchard , Tobias Schubert and Bernd Becker</i>
* [http://rd.springer.com/chapter/10.1007%2F978-3-319-24318-4_10 #∃SAT: Projected Model Counting]
** Authors: <i>Rehan Abdul Aziz, Geoffrey Chu, Christian Muise and Peter Stuckey</i>
* [http://www.iiia.csic.es/~levy/papers/SAT15.pdf Using Community Structure to Detect Relevant Learnt Clauses]
** Authors: <i>Carlos Ans ́otegui, Jes ́us Gir ́aldez-Cru, Jordi Levy and Laurent Simon</i>
* [http://arxiv.org/pdf/1505.02405.pdf Exploiting Resolution-based Representations for MaxSAT Solving]
** Authors: <i>Miguel Neves, Ruben Martins, Mikoláš Janota, Inês Lynce and Vasco Manquinho</i>
* [http://rd.springer.com/chapter/10.1007%2F978-3-319-24318-4_23 Between SAT and UNSAT: The Fundamental Difference in CDCL SAT]
** Author: <i>Chanseok Oh</i>
* [http://rd.springer.com/chapter/10.1007%2F978-3-319-24318-4_28 A New Approach to Partial MUS Enumeration]
** Authors: <i>Christian Zielke and Michael Kaufmann</i>
* [http://fmv.jku.at/papers/BiereFroehlich-SAT15.pdf Evaluating CDCL Variable Scoring Schemes]
** Authors: <i>Armin Biere and Andreas Fröhlich</i>
 
==Schedule==
The seminar meetings take place on Mondays, from 16.40 to 18.10  (DS 6) in room E05.
The seminar meetings take place on Mondays, from 16.40 to 18.10  (DS 6) in room E05.


Zeile 52: Zeile 21:
* <b>23.05.</b> Timo Richter "Pseudo-Boolean-Constraints effizienter lösen" (in German language)  
* <b>23.05.</b> Timo Richter "Pseudo-Boolean-Constraints effizienter lösen" (in German language)  
* <b> 30.05.</b> Luis Palacios Medinacelli "A full Network Specification of Skeptical Abduction"
* <b> 30.05.</b> Luis Palacios Medinacelli "A full Network Specification of Skeptical Abduction"
* <b>06.06.</b> Tobias Philipp "Proofs for Parallel SAT Solvers based on the Portfolio Approach"
* <b>06.06.</b> Tobias Philipp "The Pythagorean Triples Problem - 200 Terabytes of Proofs"
* <b>13.06.</b> Walter Forkel "Towards a Mechanically Verifiable and Efficient RUP Checker" and Anatoly Zelenin "Towards a Mechanically Verifiable Preprocessor for SAT"  
* <b>13.06.</b> Walter Forkel "Towards a Mechanically Verifiable and Efficient RUP Checker" and Anatoly Zelenin "Towards a Mechanically Verifiable Preprocessor for SAT"  
* <b>20.06.</b> Tobias Philipp "Certificates for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing"
<br>
<br>
* <b>27.06.</b> Sibylle Möhle "Better Evaluations by Analyzing Benchmark Structure"
* <b>4.07.</b> Christoph Wernhard "The PIE Environment for First-Order-Based Proving, Interpolating
and Eliminating"
}}
}}

Aktuelle Version vom 27. Juli 2016, 10:44 Uhr

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


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"


  • 27.06. Sibylle Möhle "Better Evaluations by Analyzing Benchmark Structure"
  • 4.07. Christoph Wernhard "The PIE Environment for First-Order-Based Proving, Interpolating
and Eliminating"




Abgerufen von „https://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(SS2016)&oldid=20885“