default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th FroCos 2025: Reykjavik, Iceland
- René Thiemann
, Christoph Weidenbach:
Frontiers of Combining Systems - 15th International Symposium, FroCoS 2025, Reykjavik, Iceland, September 29 - October 1, 2025, Proceedings. Lecture Notes in Computer Science 15979, Springer 2026, ISBN 978-3-032-04166-1
Description Logics
- Christian Alrabbaa, Franz Baader, Raimund Dachselt, Alisa Kovtunova, Julián Méndez:
The Concrete Evonne: Visualization Meets Concrete Domain Reasoning. 3-21 - Franz Baader, Filippo De Bortoli:
The Expressive Power of Description Logics with Numerical Constraints over Restricted Classes of Models. 22-39 - Francesco Kriegel:
Reasoning in OWL 2 EL with Hierarchical Concrete Domains. 40-60
Beyond Classical Logic
- Matthias Baaz, Mariami Gamsakhurdia, Anela Lolic:
An Analytic Representation of the Semantics of First-Order S5. 63-79 - Nicolas Peltier, Quentin Petitjean, Mihaela Sighireanu:
Deciding Satisfiability for Overlaid Symbolic Heaps. 80-97 - Colin Rothgang, Florian Rabe:
Subtyping in Dependently-Typed Higher-Order Logic. 98-114
Satisfiability Modulo Theories
- Gabriele Masina, Roberto Sebastiani:
Exploiting Partial-Assignment Enumeration in Optimization Modulo Theories. 117-134 - Benjamin Przybocki, Guilherme Vicentin de Toledo, Yoni Zohar:
Shininess, Strong Politeness, and Unicorns. 135-152 - Rodrigo Raya, Christophe Ringeissen:
Polite Combination in Parametric Array Theories. 153-168 - Guilherme Vicentin de Toledo, Yoni Zohar:
Number Theory Combination: Natural Density and SMT. 169-187
Term Rewrite Systems
- Martin Avanzini, Akihisa Yamada:
Weighted Rewriting. 191-208 - Serdar Erbatur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Graph-Embedded Rewrite Systems: Combination and Undecidability Results. 209-227 - Samuel Frontull, Manuel Meitinger, Georg Moser:
Data-Driven Runtime Complexity Analysis. 228-246 - Naoki Nishida, Misaki Kojima, Yuto Nakamura:
Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems. 247-266
Theorem Proving
- Tanguy Bozec, Jasmin Blanchette:
Iterative Monomorphisation. 269-286 - Daniel Ranalter, Cezary Kaliszyk, Florian Rabe, Geoff Sutcliffe:
The Dependently Typed Higher-Order Form for the TPTP World. 287-305 - Claudia Schon:
Context-Aware Clause Selection Using Symbol Name Meanings in Theorem Proving. 306-323
Specific Reasoning Procedures
- Parosh Aziz Abdulla, Mohamed Faouzi Atig, Julie Cailler, Chencheng Liang, Philipp Rümmer:
When GNNs Met a Word Equations Solver: Learning to Rank Equations. 327-345 - Sören Möller, Florian Bruse, Martin Lange:
A Finite Abstraction of Real-Valued Functions for Complete Reasoning About Influence. 346-363
Proof Checking
- Alessio Coltellacci, Stephan Merz:
Checking Linear Integer Arithmetic Proofs in Lambdapi. 367-385 - Giulia Sindoni, Alberto Griggio, Stefano Tonetta:
Certifying rlive: A New Proof Strategy for Liveness Model Checking. 386-403
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 2026-06-10 22:49 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:
