default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Automated Reasoning, Volume 70
Volume 70, Number 1, June 2026
- Guilherme Vicentin de Toledo, Yoni Zohar, Clark W. Barrett
:
Combining Combination Properties, Part I: Nelson-Oppen and Politeness. 1 - Mohammad Abdulaziz, Kurt Mehlhorn:
A Formal Correctness Proof of Edmonds' Blossom Shrinking Algorithm. 2 - João Cortes, Inês Lynce, Vasco Manquinho:
Unsatisfiability-based Algorithms for Multi-Objective Combinatorial Optimization. 3 - Xuanxiang Huang, Martin C. Cooper, António Morgado, Jordi Planes, João Marques-Silva:
Feature Necessity and Relevancy in Machine Learning Explanations. 4 - Branden Fitelson, Nicolas Peltier:
Applying Saturation-Based Theorem Proving to Open Problems in Positive Implicational Logic. 5 - Nils Lommen, Éléanore Meyer, Jürgen Giesl:
Targeting Completeness: Automated Complexity Analysis of Integer Programs. 6 - Yann Leray, Gaëtan Gilbert, Nicolas Tabareau, Théo Winterhalter:
The Rewster: Type Preserving Rewrite Rules for the Rocq Prover. 7 - Rajeev Goré, Anthony Peigné:
Verified Tableaux: from Modal Logics to Modal Fixpoint Logics. 8 - Olivier Laurent:
YALLA: Yet Another Deep Embedding of Linear Logic in Rocq. 9 - Jacques Garrigue, Takafumi Saikawa:
Typed Compositional Quantum Computation with Lenses. 10
Volume 70, Number 2, December 2026
- Michael Fairbank, Alexei Lisitsa, Alexei Vernitski:
Probabilistic Automaton Classifier Applied to Examples Related to the Andrews-Curtis Conjecture. 11 - Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Lea Kasche:
The Relative Strength of #SAT Proof Systems. 12 - Xicheng Peng, Jingzhong Zhang, Mao Chen, Sannyuya Liu:
Geometric Interpretation and Application of Non-degenerate Conditions in Geometric Theorem Proving. 13 - Simon Dierl, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist:
SLλ : A Scalable Algorithm for Register Automata Learning. 14 - Sarah Tilscher, Alexandra Graß, Helmut Seidl, Yannick Stade:
Proving Total Correctness of Top-Down Solvers with Widening and Narrowing. 15 - Danil Berrah, François Pessaux, Alexandre Chapoutot:
A Rocq Prover STL Formalization with Transformations for Mission Planning. 16
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-09-05 00:34 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.
