Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th TABLEAUX 2017: Brasília, Brazil
- Renate A. Schmidt, Cláudia Nalon:
Automated Reasoning with Analytic Tableaux and Related Methods - 26th International Conference, TABLEAUX 2017, Brasília, Brazil, September 25-28, 2017, Proceedings. Lecture Notes in Computer Science 10501, Springer 2017, ISBN 978-3-319-66901-4
Invited Papers
- Wolfgang Bibel:
A Vision for Automated Deduction Rooted in the Connection Method. 3-21 - Crystal Chang Din
, Reiner Hähnle, Einar Broch Johnsen, Ka I Pun, Silvia Lizeth Tapia Tarifa:
Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages. 22-43 - Katalin Bimbó:
On the Decidability of Certain Semi-Lattice Based Modal Logics. 44-61
Sequent Systems
- Ori Lahav, Yoni Zohar:
Cut-Admissibility as a Corollary of the Subformula Property. 65-80 - Sonia Marin, Lutz Straßburger:
Proof Theory for Indexed Nested Sequents. 81-97 - Christian G. Fermüller, Timo Lang:
Interpreting Sequent Calculi as Client-Server Games. 98-113 - Camillo Fiorentini, Mauro Ferrari:
A Forward Unprovability Calculus for Intuitionistic Propositional Logic. 114-130 - Marianna Girlando, Björn Lellmann, Nicola Olivetti, Gian Luca Pozzato:
Hypersequent Calculi for Lewis' Conditional Logics with Uniformity and Reflexivity. 131-148 - Marianna Girlando, Björn Lellmann, Nicola Olivetti, Gian Luca Pozzato, Quentin Vitalis:
VINTE: An Implementation of Internal Calculi for Lewis' Logics of Counterfactual Reasoning. 149-159
Tableaux
- Lee A. Barnett:
Goal-Sensitive Reasoning with Disconnection Tableaux. 163-174 - Peter Baumgartner, Sylvie Thiébaux, Felipe W. Trevizan:
Tableaux for Policy Synthesis for MDPs with PCTL* Constraints. 175-192 - Serenella Cerrito, Amélie David:
Minimisation of ATL ^* Models. 193-208 - Jens Otten:
Non-clausal Connection Calculi for Non-classical Logics. 209-227 - Dmitry Tishkovsky, Renate A. Schmidt:
Rule Refinement for Semantic Tableau Calculi. 228-244
Transitive Closure and Cyclic Proofs
- Liron Cohen:
Completeness for Ancestral Logic via a Computationally-Meaningful Semantics. 247-260 - Anupam Das, Damien Pous:
A Cut-Free Cyclic Proof System for Kleene Algebra. 261-277 - David M. Cerna, Michael Peter Lettmann:
Integrating a Global Induction Mechanism into a Sequent Calculus. 278-294 - Reuben N. S. Rowe, James Brotherston:
Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent. 295-310 - Sorin Stratulat:
Cyclic Proofs with Ordering Constraints. 311-327
Formalization and Complexity
- Peter H. Schmitt:
A Mechanizable First-Order Theory of Ordinals. 331-346 - Jeremy E. Dawson, Rajeev Goré:
Issues in Machine-Checking the Decidability of Implicational Ticket Entailment. 347-363 - Mateus de Oliveira Oliveira:
Parameterized Provability in Equational Logic. 364-380
a service of 
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 2024-04-18 21:26 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
