Decision Procedures and Applications


  • Viorica Sofronie-Stokkermans <>
  • Markus Bender <>
  • Time and place: Tuesdays, 12:00s.t.-14:00, Room B227

    First meeting: 25.10.2016

    English-German Dictionary of Deduction-related Terms


  • Deadline: ca 14 days after the talks
  • Length: 5-7 pages (preferred: 5 pages)
  • Language: English or German
  • Recommended style files (latex):
  • Recommended style files (Word):

  • Description

    General logical formalisms such as predicate logic, set theory, or number theory are undecidable or even not recursively enumerable. However, in applications it is often the case that only special fragments need to be considered, which are decidable and sometimes even have a low complexity: For instance, the theory of integers with addition is decidable; certain fragments of theories of data structures used in verification such as lists, pointers and arrays; as well as some fragments of set theory often used in knowledge representation are decidable as well. The seminar will focus on three orthogonal issues:
    Decidable theories: Identify logical theories which are decidable resp. tractable.

    Methods of proving decidability: Identify general principles for proving decidability.

    Applications: Application domains where decision procedures are used, such as
  • program verification,
  • verification of reactive systems or hybrid systems,
  • knowledge representation, description logics,
  • mathematics.

  • A preliminary list of suggested topics will be available soon.


  • Talk (ca 30 min + 5 min discussions)
  • Written abstract: ~ 5 pages.
    It is recommended to hand in the written abstract 1-2 weeks after the talk.
  • Regular participation