BEGIN:VCALENDAR VERSION:2.0 PRODID:ILLC Website X-WR-TIMEZONE:Europe/Amsterdam BEGIN:VTIMEZONE TZID:Europe/Amsterdam X-LIC-LOCATION:Europe/Amsterdam BEGIN:DAYLIGHT TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST DTSTART:19700329T020000 RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET DTSTART:19701025T030000 RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU END:STANDARD END:VTIMEZONE BEGIN:VEVENT UID:/NewsandEvents/Archives/2007/newsitem/1825/15- July-2007-Automated-Deduction-Decidability-Complex ity-Tractibility-ADDCT-07-Bremen-Germany DTSTAMP:20070422T000000 SUMMARY:Automated Deduction: Decidability, Complex ity, Tractibility (ADDCT'07), Bremen, Germany DTSTART;VALUE=DATE:20070715 DTEND;VALUE=DATE:20070715 LOCATION:Bremen, Germany DESCRIPTION:Decidability, and especially complexit y and tractability of logical theories is extremel y important for a large number of applications. Al though general logical formalisms (such as predica te logic or number theory) are undecidable, decida ble theories or decidable fragments thereof (somet imes even with low complexity) often occur in math ematics, in program verification, in the verificat ion of reactive, real time or hybrid systems, as w ell as in databases and ontologies. It is therefor e important to identify such decidable fragments a nd design efficient decision procedures for them. It is equally important to have uniform methods (s uch as resolution, rewriting, tableaux, sequent ca lculi, ...) which can be tuned to provide algorith ms with optimal complexity. The goal of ADDCT is to bring together researchers interested in - ide ntifying (fragments of) logical theories which are decidable, identifying fragments thereof which ha ve low complexity, and analyzing possibilities of obtaining optimal complexity results with uniform tools; - analyzing decidability in combinations o f theories and possibilities of combining decision procedures; - efficient implementations for deci dable fragments; - application domains where deci dability resp. tractability are crucial. For mor e information, see http://www.mpi-inf.mpg.de/~sofr onie/addct07.html or contact Viorica Sofronie-Stok kermans at sofronie at mpi-inf.mpg.de. The Prog ramme Committee cordially invites all researchers to submit their work for presentation, including o riginal papers, presentation-only papers and work in progress. Given the informal style of the works hop, the submission of papers presenting student's work and work in progress is encouraged. Submissi on deadline is 4 May 2007. X-ALT-DESC;FMTTYPE=text/html:
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
div>\n The Programme Commit tee cordially invites all researchers\n to submit their work for presentation, including orig inal papers,\n presentation-only papers and work in progress. Given the informal style of the workshop, the submission of papers\n prese nting student's work and work in progress is encou raged.\n Submission deadline is 4 May 2007 .\n
\n