default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th FroCos 2021: Birmingham, UK
- Boris Konev, Giles Reger:
Frontiers of Combining Systems - 13th International Symposium, FroCoS 2021, Birmingham, UK, September 8-10, 2021, Proceedings. Lecture Notes in Computer Science 12941, Springer 2021, ISBN 978-3-030-86204-6
Calculi and Unification
- Martin Bromberger, Irina Dragoste, Rasha Faqeh, Christof Fetzer, Markus Krötzsch, Christoph Weidenbach:
A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic. 3-24 - Serdar Erbatur
, Andrew M. Marshall, Christophe Ringeissen:
Non-disjoint Combined Unification and Closure by Equational Paramodulation. 25-42 - Dennis Peuter, Viorica Sofronie-Stokkermans:
Symbol Elimination and Applications to Parametric Entailment Problems. 43-62 - K. Subramani, Piotr Wojciechowski, Alvaro Velasquez:
On the Copy Complexity of Width 3 Horn Constraint Systems. 63-78
Description Logics
- Franz Baader, Oliver Fernández Gil, Maryam Rostamigiv:
Restricted Unification in the DL ℱ0. 81-97 - Peter Baumgartner:
Combining Event Calculus and Description Logic Reasoning via Logic Programming. 98-117 - Mostafa Sakr, Renate A. Schmidt:
Semantic Forgetting in Expressive Description Logics. 118-136
Interactive Theorem Proving
- Antoine Defourné:
Improving Automation for Higher-Order Proof Steps. 139-153 - Qingxiang Wang, Cezary Kaliszyk:
JEFL: Joint Embedding of Formal Proof Libraries. 154-170
Machine Learning
- Zarathustra Amadeus Goertzel, Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban:
Fast and Slow Enigmas and Parental Guidance. 173-191 - Martin Suda:
Vampire with a Brain Is a Good ITP Hammer. 192-209
Satisfiability Modulo Theories
- Filippo Bigarella, Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Martin Jonás, Marco Roveri, Roberto Sebastiani, Patrick Trentin:
Optimization Modulo Non-linear Arithmetic via Incremental Linearization. 213-231 - Pascal Fontaine, Hans-Jörg Schurr:
Quantifier Simplification by Unification in SMT. 232-249
Verification
- Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Brandon Rozek:
Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems. 253-270 - Hai Lin, Christopher Lynch:
Formal Analysis of Symbolic Authenticity. 271-286 - Laine E. Rumreich, Paolo A. G. Sivilotti:
Formal Verification of a Java Component Using the RESOLVE Framework. 287-305
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-08-09 22:54 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
