Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. FroCos 2015: Wroclaw, Poland
- Carsten Lutz
, Silvio Ranise:
Frontiers of Combining Systems - 10th International Symposium, FroCoS 2015, Wroclaw, Poland, September 21-24, 2015. Proceedings. Lecture Notes in Computer Science 9322, Springer 2015, ISBN 978-3-319-24245-3
Invited Talk
- Peter Backeman, Philipp Rümmer:
Free Variables and Theories: Revisiting Rigid E-unification. 3-13
Description Logics
- Stephan Böhme, Marcel Lippmann:
Decidable Description Logics of Context with Rigid Roles. 17-32 - Franz Baader, Gerhard Brewka, Oliver Fernandez Gil:
Adding Threshold Concepts to the Description Logic EL. 33-48 - Stefan Borgwardt, Rafael Peñaloza:
Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics. 49-65
Theorem Proving and Model Building
- Gábor Alagi, Christoph Weidenbach:
NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment. 69-84 - Andreas Teucke, Christoph Weidenbach:
First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation. 85-100 - Tobias Philipp:
An Expressive Model for Instance Decomposition Based Parallel SAT Solvers. 101-116
Decision Procedures
- Jürgen Christ, Jochen Hoenicke:
Weakly Equivalent Arrays. 119-134 - Tianyi Liang, Nestan Tsiskaridze, Andrew Reynolds, Cesare Tinelli, Clark W. Barrett:
A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings. 135-150 - Maximilian Jaroschek, Pablo Federico Dobal, Pascal Fontaine:
Adapting Real Quantifier Elimination Methods for Conflict Set Computation. 151-166
Decision Procedures for Verification
- Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
A New Acceleration-Based Combination Framework for Array Properties. 169-185 - Werner Damm, Matthias Horbach, Viorica Sofronie-Stokkermans:
Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata. 186-202
Rewriting and Constraint Solving
- Guillaume Burel, Gilles Dowek, Ying Jiang:
A Completion Method to Decide Reachability in Rewrite Systems. 205-219 - Damien Rouhling, Mahfuza Farooque, Stéphane Graham-Lengrand, Assia Mahboubi, Jean-Marc Notin:
Axiomatic Constraint Systems for Proof Search Modulo Theories. 220-236
Transformations between Symbolic Systems
- Sarah Winkler, René Thiemann:
Formalizing Soundness and Completeness of Unravelings. 239-255 - Nik Sultana, Christoph Benzmüller, Lawrence C. Paulson:
Proofs and Reconstructions. 256-271
Combination Methods
- Paula Daniela Chocron, Pascal Fontaine, Christophe Ringeissen:
A Rewriting Approach to the Combination of Data Structures with Bridging Theories. 275-290 - Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Unification and Matching in Hierarchical Combinations of Syntactic Theories. 291-306 - Amira Zaki, Slim Abdennadher, Thom W. Frühwirth:
Combining Forward and Backward Propagation. 307-322
Reasoning in Large Theories
- Michael Färber, Cezary Kaliszyk:
Random Forests for Premise Selection. 325-340 - Cezary Kaliszyk, Josef Urban, Jirí Vyskocil:
Lemmatization for Stronger Reasoning in Large Theories. 341-356
a service of 
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-09-05 23:30 CEST 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:
