- 2011
- Carlos Areces
, Pascal Fontaine:
Combining Theories: The Ackerman and Guarded Fragments. FroCoS 2011: 40-54 - Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev:
Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models. FroCoS 2011: 1-11 - Franz Baader, Rafael Peñaloza:
On the Undecidability of Fuzzy Description Logics with GCIs and Product T-norm. FroCoS 2011: 55-70 - Marcello M. Bersani, Stéphane Demri:
The Complexity of Reversal-Bounded Model-Checking. FroCoS 2011: 71-86 - Jasmin Christian Blanchette, Lukas Bulwahn, Tobias Nipkow:
Automatic Proof and Disproof in Isabelle/HOL. FroCoS 2011: 12-27 - François Bobot, Andrey Paskevich:
Expressing Polymorphic Types in a Many-Sorted Language. FroCoS 2011: 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. FroCoS 2011: 103-118 - Luis Fariñas del Cerro, Andreas Herzig:
The Modal Logic of Equilibrium Models. FroCoS 2011: 135-146 - Andreas Eggers, Evgeny Kruglov, Stefan Kupferschmid, Karsten Scheibler, Tino Teige, Christoph Weidenbach:
Superposition Modulo Non-linear Arithmetic. FroCoS 2011: 119-134 - Carsten Fuhs, Cynthia Kop:
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs. FroCoS 2011: 147-162 - Alberto Griggio, Quoc-Sang Phan, Roberto Sebastiani, Silvia Tomasi:
Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT. FroCoS 2011: 163-178 - Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai:
Controlled Term Rewriting. FroCoS 2011: 179-194 - Dejan Jovanovic, Clark W. Barrett:
Sharing Is Caring: Combination of Theories. FroCoS 2011: 195-210 - Martin Lange:
Size-Change Termination and Satisfiability for Linear-Time Temporal Logics. FroCoS 2011: 28-39 - Christophe Ringeissen, Valerio Senni:
Modular Termination and Combinability for Superposition Modulo Counter Arithmetic. FroCoS 2011: 211-226 - Manfred Schmidt-Schauß, David Sabel, Altug Anis:
Congruence Closure of Compressed Terms in Polynomial Time. FroCoS 2011: 227-242 - Christian Sternagel, René Thiemann:
Generalized and Formalized Uncurrying. FroCoS 2011: 243-258 - Shahab Tasharrofi, Eugenia Ternovska:
A Semantic Account for Modularity in Multi-language Modelling of Search Problems. FroCoS 2011: 259-274 - 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 [contents] - 2009
- Ernst Althaus, Evgeny Kruglov, Christoph Weidenbach:
Superposition Modulo Linear Arithmetic SUP(LA). FroCoS 2009: 84-99 - Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Homomorphic Encryption. FroCoS 2009: 100-116 - Takahito Aoto, Toshiyuki Yamada:
Argument Filterings and Usable Rules for Simply Typed Dependency Pairs. FroCoS 2009: 117-132 - Alessandro Armando:
Building SMT-Based Software Model Checkers: An Experience Report. FroCoS 2009: 1-17 - Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev:
DL-Lite with Temporalised Concepts, Rigid Axioms and Roles. FroCoS 2009: 133-148 - Franz Baader, Andreas Bauer, Marcel Lippmann:
Runtime Verification Using a Temporal Description Logic. FroCoS 2009: 149-164 - Philippe Balbiani:
Axiomatization and Completeness of Lexicographic Products of Modal Logics. FroCoS 2009: 165-180 - Guillaume Burel:
Automating Theories in Intuitionistic Logic. FroCoS 2009: 181-197 - Clare Dixon, Michael Fisher, Boris Konev:
Taming the Complexity of Temporal Epistemic Reasoning. FroCoS 2009: 198-213 - Conrad Drescher, Hongkai Liu, Franz Baader, Steffen Guhlemann, Uwe Petersohn, Peter Steinke, Michael Thielscher:
Putting ABox Updates into Action. FroCoS 2009: 214-229 - Conrad Drescher, Stephan Schiffel, Michael Thielscher:
A Declarative Agent Programming Language Based on Action Theories. FroCoS 2009: 230-245
