default search action
8. FroCos 2011: Saarbrücken, Germany
- Cesare Tinelli
, Viorica Sofronie-Stokkermans:
Frontiers of Combining Systems, 8th International Symposium, FroCoS 2011, Saarbrücken, Germany, October 5-7, 2011. Proceedings. Lecture Notes in Computer Science 6989, Springer 2011, ISBN 978-3-642-24363-9
Invited Papers
- Alessandro Artale, Roman Kontchakov
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
Combining Theories: The Ackerman and Guarded Fragments. 40-54 - Franz Baader
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
Expressing Polymorphic Types in a Many-Sorted Language. 87-102 - Roberto Bruttomesso, Silvio Ghilardi
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
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 W. 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
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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-15 01:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: