Workshop: Complexity, Expressibility, and Decidability in Automated Reasoning – CEDAR'08
Franz Baader, Silvio Ghilardi, Miki Hermann, Ulrike Sattler, Viorica Sofronie-Stokkermans · 2008
The goal of CEDAR was to bring together researchers interested in problems at the interface between automated reasoning and computational complexity, in particular in: – identifying (fragments of) logical theories which are decidable, resp. have low complexity, and analyzing possibilities of obtaining optimal complexity results with uniform tools; – analyzing decidability in combinations of theories and possibilities of combining decision procedures; – efficient implementations for decidable fragments; – application domains where decidability resp. tractability are crucial. With the development of computer science these problems are becoming extremely important. In the last years, for instance, automated reasoning techniques found a large number of practical applications ranging from knowledge representation (reasoning in non-classical logics, reasoning in large databases and ontologies) to program verification and verification of reactive, real time