Decision Procedures for Logical Theories
Viorica Sofronie-Stokkermans <firstname.lastname@example.org>
Time and place: Wednesday, 14:00-16:00, Room E 016
First meeting: Wednesday, 17.04.2013, 14:00-16:00, Room F 330.
(for more advice on giving research talks click here)
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.
Application domains where decision procedures are used, such as
A preliminary list of suggested topics is available here