default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th TABLEAUX 2019: London, UK
- Serenella Cerrito, Andrei Popescu:
Automated Reasoning with Analytic Tableaux and Related Methods - 28th International Conference, TABLEAUX 2019, London, UK, September 3-5, 2019, Proceedings. Lecture Notes in Computer Science 11714, Springer 2019, ISBN 978-3-030-29025-2
Tableau Calculi
- Luca Geatti
, Nicola Gigante, Angelo Montanari:
A SAT-Based Encoding of the One-Pass and Tree-Shaped Tableau System for LTL. 3-20 - Michael Färber, Cezary Kaliszyk:
Certification of Nonclausal Connection Tableaux Proofs. 21-38 - Katarina Britz, Ivan Varzinczak:
Preferential Tableaux for Contextual Defeasible ALC. 39-57 - Chu Min Li, Felip Manyà, Joan Ramon Soler:
A Tableau Calculus for Non-clausal Maximum Satisfiability. 58-73
Sequent Calculi
- Yotam Dvir, Arnon Avron:
First-Order Quasi-canonical Proof Systems. 77-93 - Agata Ciabattoni, Timo Lang, Revantha Ramanayake:
Bounded Sequent Calculi for Non-classical Logics via Hypersequents. 94-110 - Camillo Fiorentini, Rajeev Goré, Stéphane Graham-Lengrand:
A Proof-Theoretic Perspective on SMT-Solving for Intuitionistic Propositional Logic. 111-129 - Didier Galmiche, Michel Marti, Daniel Méry:
Relating Labelled and Label-Free Bunched Calculi in BI Logic. 130-146 - Elaine Pimentel, Revantha Ramanayake, Björn Lellmann:
Sequentialising Nested Systems. 147-165 - Anthony Lick:
A Hypersequent Calculus with Clusters for Data Logic over Ordinals. 166-184 - Rajeev Goré, Björn Lellmann:
Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents. 185-202 - Björn Lellmann:
Combining Monotone and Normal Modal Logic in Nested Sequents - with Countermodels. 203-220
Semantics and Combinatorial Proofs
- Matteo Acclavio, Lutz Straßburger:
On Combinatorial Proofs for Modal Logic. 223-240 - Timo Lang, Carlos Olarte, Elaine Pimentel, Christian G. Fermüller:
A Game Model for Proofs with Costs. 241-258 - Benjamin Ralph, Lutz Straßburger:
Towards a Combinatorial Proof Theory. 259-276 - Daniel Gâinâ, Ionut Tutu:
Birkhoff Completeness for Hybrid-Dynamic First-Order Logic. 277-293
Non-Wellfounded Proof Systems
- Abhishek De, Alexis Saurin:
Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory. 297-316 - Rémi Nollet, Alexis Saurin, Christine Tasson:
PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points. 317-334 - Simon Docherty, Reuben N. S. Rowe:
A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic. 335-352
Automated Theorem Provers
- Gabriel Ebner:
Herbrand Constructivization for Automated Intuitionistic Theorem Proving. 355-373 - Zarathustra Amadeus Goertzel, Jan Jakubuv, Josef Urban:
ENIGMAWatch: ProofWatch Meets ENIGMA. 374-388
Logics for Program or System Verification
- Eduard Kamburjan:
Behavioral Program Logic. 391-408 - Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Prenex Separation Logic with One Selector Field. 409-427 - João G. Martins, André Platzer, João Leite:
Dynamic Doxastic Differential Dynamic Logic for Belief-Aware Cyber-Physical Systems. 428-445 - Ioana Leustean, Natalia Moanga, Traian-Florin Serbanuta:
Operational Semantics and Program Verification Using Many-Sorted Hybrid Modal Logic. 446-476
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-14 00:28 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.
