Benjamin Kiesl


Research Interests

  • Automated Reasoning (in particular SAT, QBF, and First-Order Theorem Proving)
  • Knowledge Representation
  • Logic Programming (in particular Answer-Set Programming)

Current Position


Education


Publications

  • Marijn J.H. Heule, Benjamin Kiesl, Martina Seidl, and Armin Biere (2017):
  • PRuning Through Satisfaction.
  • Accepted for: Proceedings of the 13th Haifa Verification Conference (HVC 2017).
  • .
  • Benjamin Kiesl, Marijn J.H. Heule, and Martina Seidl (2017):
  • A Little Blocked Literal Goes a Long Way.
  • In: Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT 2017).
  • .
  • Benjamin Kiesl, Martina Seidl, Hans Tompits, and Armin Biere (2017):
  • Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood?
  • In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017).
  • .
  • Benjamin Kiesl and Martin Suda (2017):
  • A Unifying Principle for Clause Elimination in First-Order Logic.
  • In: Proceedings of the 26th International Conference on Automated Deduction (CADE-26). Best Paper Award.
  • .
  • Marijn J.H. Heule, Benjamin Kiesl, and Armin Biere (2017):
  • Short Proofs Without New Variables.
  • In: Proceedings of the 26th International Conference on Automated Deduction (CADE-26). Best Paper Award.
  • .
  • Marijn J.H. Heule and Benjamin Kiesl (2017):
  • The Potential of Interference-Based Proof Systems.
  • In: Proceedings of the 1st ARCADE Workshop (ARCADE 2017).
  • .
  • Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, and Armin Biere (2017):
  • Blocked Clauses in First-Order Logic.
  • In: Proceedings of the 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-21).
  • .
  • Benjamin Kiesl, Martina Seidl, Hans Tompits, and Armin Biere (2016):
  • Super-Blocked Clauses.
  • In: Proceedings of the 8th International Joint Conference on Automated Reasoning (IJCAR 2016).
  • .
  • Benjamin Kiesl, Peter Schüller, and Hans Tompits (2015):
  • On Structural Analysis of Non-Ground Answer-Set Programs.
  • In: Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015).