default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th IJCAR 2026: Lisbon, Portugal - Part I
- Armin Biere
, Carsten Lutz, Sara Negri:
Automated Reasoning - 13th International Joint Conference, IJCAR 2026, Lisbon, Portugal, July 26-29, 2026, Proceedings, Part I. Lecture Notes in Computer Science 16688, Springer 2026, ISBN 978-3-032-32588-4
Theorem Proving and Automation
- Lydia Kondylidou, Jasmin Blanchette, Marijn J. H. Heule:
Tao's Equational Proof Challenge Accepted. 3-21 - Márton Hajdú, Petra Hozzová, Laura Kovács, Eva Maria Wagner:
Completeness of Synthesis Under Realizability Assumptions Using Superposition. 22-40 - Christoph Wernhard:
Generating Theorems by Generating Proof Structures. 41-61 - Guy Axelrod, Moa Johansson, Nicholas Smallbone:
Twitch: Learning Abstractions for Equational Theorem Proving. 62-79 - Adam Dingle:
Towards Fast Automatic Verification of Textbook Proof Steps. 80-97 - Romain Sidhoum, Simon Robillard, David Delahaye:
Pgeon: Generating Tableau-Based Provers from Declarative Specifications of Logical Calculi. 98-105 - Kim Morrison, Leonardo de Moura:
grind: An SMT-Inspired Tactic for Lean 4 (Short Paper - System Description). 106-114
SAT, SMT, and Verification
- Markus Kirchweger, Pablo Manrique, Stefan Szeider:
Formally Verified Graph Generation with SAT Modulo Symmetries and Lean. 117-135 - Florian Frohn, Jürgen Giesl:
Accelerating Loops with Arrays. 136-155 - Joseph E. Reeves, Haniel Barbosa, Andrew Reynolds, Marijn J. H. Heule:
A General Approach for SMT Proof Skeletons. 156-174 - Clemens Hofstadler, Daniela Kaufmann, Chen Chen:
Avoiding Big Integers: Parallel Multimodular Algebraic Verification of Arithmetic Circuits. 175-193 - Guilherme Vicentin de Toledo, Benjamin Przybocki, Yoni Zohar:
Bringing Closure to Theory Combination Properties. 194-211 - Ciarán Dunne, Guillaume Burel:
Automatically Translating Proof Systems for SMT Solvers to the λ Π-Calculus. 212-229 - Viorica Sofronie-Stokkermans:
On Constructing Most General Solutions for Parametric Constraints. 230-247 - S. Akshay, Supratik Chakraborty, R. Govind, Aniruddha R. Joshi:
Program Synthesis for Non-linear Real Arithmetic: Going Beyond Realizability. 248-266 - Ofec Israel, Yoni Zohar, Andrew Reynolds, S. Hitarth, Bruno Dutertre, Clark W. Barrett, Cesare Tinelli:
Checking Regular Expressions in Cvc5 Proofs. 267-275 - Nils Froleyks, Emily Yu:
Hardware Model Checking Certification with Certifaiger and Cerbtora. 276-285 - Emanuele Civini, Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani:
Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT. 286-304 - Andrew Reynolds, Hans-Jörg Schurr, Mallku Soldevila, Haniel Barbosa, Clark W. Barrett, Cesare Tinelli:
Ethos: A Fast Proof Checker for the Eunoia Logical Framework. 305-314
Intuitionistic, Modal, and Temporal Logics
- Happy Khairunnisa Sariyanto, Alexander Steen, Geoff Sutcliffe:
Finite Model Finding in First-Order Modal Logics. 317-335 - Hugo Férée, Ian Shillito:
Pitts and Intuitionistic Multi-Succedent: Uniform Interpolation for KM. 336-356 - Iris van der Giessen, Ian Shillito:
Uniform Interpolation with Constructive Diamond. 357-376 - Naijun Zhan, Wen Tang, Dimitar P. Guelev:
A Complete Proof System for HyperLTL. 377-395 - Benjamin Bordais, Daniel Neider, Mustafa Yalçiner:
Learning Computation Tree Logic with Neural Networks. 396-413 - Antonella Bilotta, Marco Maggesi, Cosimo Perini Brogi:
Growing HOLMS: A Verified Automated Prover for Grzegorczyk Logic in HOL Light. 414-435 - Malak Marrid, Shachar Itzhaky, Sharon Shoham, Yakir Vizel:
Automatic Abstraction Refinement for Hyperproperties Verification. 436-454 - Christian Köll, Agata Ciabattoni, Dmitry Rozplokhas:
SMT-Based Deontic Reasoning for Åqvist Logics. 455-464
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-07-29 23:07 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.
