ADDCT'07: Call for Participation: Early Reg. Deadline Jun 10

[Ashish Tiwari]

                  CALL FOR PARTICIPATION

 Automated Deduction: Decidability, Complexity, Tractability
                     (ADDCT'07)

        Workshop affiliated with CADE-21 Bremen, 
               Germany, 15 July, 2007 

For complete information- http://www.mpi-inf.mpg.de/~sofronie/addct07.html
          
Early Registration Deadline:
----------------------------
  10 June 2007

Tentative Program:
------------------
09:30-10:30 Session 1:  Invited talk
09:30-10:30 Michael Rusinowitch (LORIA-INRIA-Lorraine)
	TBA

10:30-11:00 Coffee Break

11:00-12:30 Session 2: Decidable fragments of first-order logic and
applications

11:00-11:35   	Stephanie Delaune, Hai Lin and Christopher Lynch
	Protocol Verification via Rigid/Fleixble Resolution
11:35-12:10   	Sharon Abadi, Alexander Rabinovich and Mooly Sagiv
	Decidable Fragments of Many Sorted Logic
12:10-12:30   	Maria Paola Bonacina and Mnacho Echenim
	Decision procedures for variable-inactive theories and 
	two polynomial T-satisfiability procedures

12:30-14:00 Lunch Break

14:00-15:30 Session 3: Decidability in intuitionistic, modal and description
logics

14:00-14:35   	Linh Anh Nguyen
	Approximating Horn Knowledge Bases in Regular Description Logics 
	to Have PTIME Data Complexity
14:35-15:10   	Didier Galmiche and Daniel Mery
	Connection-based proof search in intuitionistic logic 
	from transitive closure of constraints
15:10-15:30   	Carsten Lutz and Frank Wolter
	Conservative extensions in modal and description logics 

15:30-16:00 Coffee Break

16:00-17:00 Session 4: Combinations of decision procedures

16:00-16:20   	Sava Krstic, Amit Goel, Jim Grundy and Cesare Tinelli.
	Combined Satisfiability Modulo Parametric Theories
16:20-16:40   	Leonardo de Moura, and Nikolaj Bjorner
	Model-based Theory Combination
16:40-17:00   	Viktor Kuncak, Charles Bouillaguet, Thomas Wies, Karen Zee and
Martin Rinard.
	Decision procedures for data structure verification 

End of Program