default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th IJCAR 2024: Nancy, France - Part II
- Christoph Benzmüller
, Marijn J. H. Heule, Renate A. Schmidt:
Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings, Part II. Lecture Notes in Computer Science 14740, Springer 2024, ISBN 978-3-031-63500-7
Intuitionistic Logics and Modal Logics
- Ullrich Hustadt, Fabio Papacchini, Cláudia Nalon, Clare Dixon:
Model Construction for Modal Clauses. 3-23 - Camillo Fiorentini, Mauro Ferrari:
A Terminating Sequent Calculus for Intuitionistic Strong Löb Logic with the Subformula Property. 24-42 - Hugo Férée, Iris van der Giessen, Sam van Gool, Ian Shillito:
Mechanised Uniform Interpolation for Modal Logics K, GL, and iSL. 43-60 - Alessandro Bruni, Eike Ritter, Carsten Schürmann:
Skolemisation for Intuitionistic Linear Logic. 61-77 - Philippe Balbiani, Han Gao, Çigdem Gencer, Nicola Olivetti:
Local Intuitionistic Modal Logics and Their Calculi. 78-96 - Dirk Pattinson, Cláudia Nalon:
Non-iterative Modal Resolution Calculi. 97-113 - Hans van Ditmarsch, Krisztina Fruzsa, Roman Kuznets, Ulrich Schmid:
A Logic for Repair and State Recovery in Byzantine Fault-Tolerant Multi-agent Systems. 114-134
Calculi, Proof Theory and Decision Procedures
- Harald Ruess:
A Decision Method for First-Order Stream Logic. 137-156 - Tanguy Bozec, Nicolas Peltier, Quentin Petitjean, Mihaela Sighireanu:
What Is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment? 157-175 - Agata Ciabattoni, Matteo Tesi:
Sequents vs Hypersequents for Åqvist Systems. 176-195 - Enguerrand Prebet, André Platzer:
Uniform Substitution for Differential Refinement Logic. 196-215 - Matteo Acclavio:
Sequent Systems on Undirected Graphs. 216-236 - Anupam Das, Abhishek De:
A Proof Theory of (ømega-)Context-Free Languages, via Non-wellfounded Proofs. 237-256 - Jan Rooduijn, Dexter Kozen, Alexandra Silva:
A Cyclic Proof System for Guarded Kleene Algebra with Tests. 257-275
Unification, Rewriting and Computational Models
- Franz Baader, Oliver Fernández Gil:
Unification in the Description Logic ELHℛ+ Without the Top Concept Modulo Cycle-Restricted Ontologies. 279-297 - Jonas Schöpf, Fabian Mitterwallner, Aart Middeldorp:
Confluence of Logically Constrained Rewrite Systems Revisited. 298-316 - Mauricio Ayala-Rincón, David M. Cerna, Andres Felipe Gonzalez Barragan, Temur Kutsia:
Equational Anti-unification over Absorption Theories. 317-337 - Victor Arrial, Giulio Guerrieri, Delia Kesner:
The Benefits of Diligence. 338-359 - Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl:
A Dependency Pair Framework for Relative Termination of Term Rewriting. 360-380 - Georg Ehling, Temur Kutsia:
Solving Quantitative Equations. 381-400 - Jingyi Mei, Tim Coopmans, Marcello M. Bonsangue, Alfons Laarman:
Equivalence Checking of Quantum Circuits by Model Counting. 401-421
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 2025-03-04 02:03 CET 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:
