Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030290252, 9783030290269

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Sequentialising Nested Systems

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/978-3-030-29026-9_9 ◽

2019 ◽

pp. 147-165 ◽

Cited By ~ 1

Author(s):

Elaine Pimentel ◽

Revantha Ramanayake ◽

Björn Lellmann

Download Full-text

Relating Labelled and Label-Free Bunched Calculi in BI Logic

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/978-3-030-29026-9_8 ◽

2019 ◽

pp. 130-146

Author(s):

Didier Galmiche ◽

Michel Marti ◽

Daniel Méry

Keyword(s):

Label Free

Download Full-text

A Proof-Theoretic Perspective on SMT-Solving for Intuitionistic Propositional Logic

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/978-3-030-29026-9_7 ◽

2019 ◽

pp. 111-129

Author(s):

Camillo Fiorentini ◽

Rajeev Goré ◽

Stéphane Graham-Lengrand

Keyword(s):

Propositional Logic ◽

Intuitionistic Propositional Logic ◽

Smt Solving

Download Full-text

Bounded Sequent Calculi for Non-classical Logics via Hypersequents

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/978-3-030-29026-9_6 ◽

2019 ◽

pp. 94-110 ◽

Cited By ~ 1

Author(s):

Agata Ciabattoni ◽

Timo Lang ◽

Revantha Ramanayake

Keyword(s):

Sequent Calculi

Download Full-text

First-Order Quasi-canonical Proof Systems

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/978-3-030-29026-9_5 ◽

2019 ◽

pp. 77-93

Author(s):

Yotam Dvir ◽

Arnon Avron

Keyword(s):

First Order ◽

Proof Systems

Download Full-text

Herbrand Constructivization for Automated Intuitionistic Theorem Proving

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/978-3-030-29026-9_20 ◽

2019 ◽

pp. 355-373

Author(s):

Gabriel Ebner

Keyword(s):

Theorem Proving

Download Full-text

Birkhoff Completeness for Hybrid-Dynamic First-Order Logic

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/978-3-030-29026-9_16 ◽

2019 ◽

pp. 277-293 ◽

Cited By ~ 1

Author(s):

Daniel Găină ◽

Ionuţ Ţuţu

Keyword(s):

Order Logic ◽

First Order Logic ◽

First Order

Download Full-text

A Game Model for Proofs with Costs

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/978-3-030-29026-9_14 ◽

2019 ◽

pp. 241-258 ◽

Cited By ~ 1

Author(s):

Timo Lang ◽

Carlos Olarte ◽

Elaine Pimentel ◽

Christian G. Fermüller

Keyword(s):

Game Model

Download Full-text

Combining Monotone and Normal Modal Logic in Nested Sequents – with Countermodels

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/978-3-030-29026-9_12 ◽

2019 ◽

pp. 203-220 ◽

Cited By ~ 4

Author(s):

Björn Lellmann

Keyword(s):

Modal Logic ◽

Normal Modal Logic ◽

Nested Sequents

Download Full-text

Operational Semantics and Program Verification Using Many-Sorted Hybrid Modal Logic

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/978-3-030-29026-9_25 ◽

2019 ◽

pp. 446-476

Author(s):

Ioana Leuştean ◽

Natalia Moangă ◽

Traian Florin Şerbănuţă

Keyword(s):

Modal Logic ◽

Program Verification ◽

Operational Semantics

Download Full-text

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related MethodsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Sequentialising Nested Systems

Relating Labelled and Label-Free Bunched Calculi in BI Logic

A Proof-Theoretic Perspective on SMT-Solving for Intuitionistic Propositional Logic

Bounded Sequent Calculi for Non-classical Logics via Hypersequents

First-Order Quasi-canonical Proof Systems

Herbrand Constructivization for Automated Intuitionistic Theorem Proving

Birkhoff Completeness for Hybrid-Dynamic First-Order Logic

A Game Model for Proofs with Costs

Combining Monotone and Normal Modal Logic in Nested Sequents – with Countermodels

Operational Semantics and Program Verification Using Many-Sorted Hybrid Modal Logic

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods
Latest Publications