Decid ability, and especially complexity and tractabilit y of \n logical theories is extremely impor tant for a large number of \n applications. Although general logical formalisms (such as \n predicate logic or number theory) are undeci dable, decidable \n theories or decidable f ragments thereof (sometimes even with low \n complexity) often occur in mathematics, in progr am verification, \n in the verification of reactive, real time or hybrid systems, \n a s well as in databases and ontologies. It is there fore important \n to identify such decidabl e fragments and design efficient decision \n procedures for them. It is equally important to have uniform methods \n (such as resolution , rewriting, tableaux, sequent calculi, ...) \n which can be tuned to provide algorithms with optimal complexity.\n
\nThe goa
l of ADDCT is to bring together researchers intere
sted in\n - identifying (fragments of) logi
cal theories which are decidable, \n iden
tifying fragments thereof which have low complexit
y, and \n analyzing possibilities of obta
ining optimal complexity results \n with
uniform tools;
\n - analyzing decidabi
lity in combinations of theories and possibilities
\n of combining decision procedures;
\n - efficient implementations for decidab
le fragments;
\n - application domains
where decidability resp. tractability are crucial
. \n
For more in formation, see\n h ttp://www.mpi-inf.mpg.de/~sofronie/addct07.html\n or contact \n Viorica Sofronie-S tokkermans at sofronie at mpi-inf.mpg.de.\n
\n\n The Programme Committee cordially invites all researchers\n to submit their work for presentation, includin g original papers,\n presentation-only pape rs and work in progress. Given the informal style of the workshop, the submission of papers\n presenting student's work and work in progress is encouraged.\n Submission deadline is 4 Ma y 2007.\n
\n