8. FroCos 2011: Saarbrücken, Germany

Invited Papers

• Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev:
  Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models. 1-11
  
• Jasmin Christian Blanchette, Lukas Bulwahn, Tobias Nipkow:
  Automatic Proof and Disproof in Isabelle/HOL. 12-27
  
• Martin Lange:
  Size-Change Termination and Satisfiability for Linear-Time Temporal Logics. 28-39
  

Contributed Papers

• Carlos Areces, Pascal Fontaine:
  Combining Theories: The Ackerman and Guarded Fragments. 40-54
  
• Franz Baader, Rafael Peñaloza:
  On the Undecidability of Fuzzy Description Logics with GCIs and Product T-norm. 55-70
  
• Marcello M. Bersani, Stéphane Demri:
  The Complexity of Reversal-Bounded Model-Checking. 71-86
  
• François Bobot, Andrey Paskevich:
  Expressing Polymorphic Types in a Many-Sorted Language. 87-102
  
• Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise:
  A Combination of Rewriting and Constraint Solving for the Quantifier-Free Interpolation of Arrays with Integer Difference Constraints. 103-118
  
• Andreas Eggers, Evgeny Kruglov, Stefan Kupferschmid, Karsten Scheibler, Tino Teige, Christoph Weidenbach:
  Superposition Modulo Non-linear Arithmetic. 119-134
  
• Luis Fariñas del Cerro, Andreas Herzig:
  The Modal Logic of Equilibrium Models. 135-146
  
• Carsten Fuhs, Cynthia Kop:
  Harnessing First Order Termination Provers Using Higher Order Dependency Pairs. 147-162
  
• Alberto Griggio, Quoc-Sang Phan, Roberto Sebastiani, Silvia Tomasi:
  Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT. 163-178
  
• Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai:
  Controlled Term Rewriting. 179-194
  
• Dejan Jovanovic, Clark Barrett:
  Sharing Is Caring: Combination of Theories. 195-210
  
• Christophe Ringeissen, Valerio Senni:
  Modular Termination and Combinability for Superposition Modulo Counter Arithmetic. 211-226
  
• Manfred Schmidt-Schauß, David Sabel, Altug Anis:
  Congruence Closure of Compressed Terms in Polynomial Time. 227-242
  
• Christian Sternagel, René Thiemann:
  Generalized and Formalized Uncurrying. 243-258
  
• Shahab Tasharrofi, Eugenia Ternovska:
  A Semantic Account for Modularity in Multi-language Modelling of Search Problems. 259-274
  

Last update Fri May 25 08:14:23 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page