Theorem Proving with Analytic Tableaux and Related Methods - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

20

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540612087, 9783540683681

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Cyclic connections

Theorem Proving with Analytic Tableaux and Related Methods - Lecture Notes in Computer Science ◽

10.1007/3-540-61208-4_6 ◽

1996 ◽

pp. 80-92 ◽

Author(s):

Gérard Becher

Download Full-text

Combining many-valued and intuitionistic tableaux

Theorem Proving with Analytic Tableaux and Related Methods - Lecture Notes in Computer Science ◽

10.1007/3-540-61208-4_5 ◽

1996 ◽

pp. 65-79 ◽

Author(s):

Matthias Baaz ◽

Christian G. Fermüller

Download Full-text

Almost duplication-free tableau calculi for prepositional lax logics

Theorem Proving with Analytic Tableaux and Related Methods - Lecture Notes in Computer Science ◽

10.1007/3-540-61208-4_4 ◽

1996 ◽

pp. 48-64 ◽

Author(s):

Alessandro Avellone ◽

Mauro Ferrari

Keyword(s):

Tableau Calculi

Download Full-text

Strong normalization for all-style LKtq

Theorem Proving with Analytic Tableaux and Related Methods - Lecture Notes in Computer Science ◽

10.1007/3-540-61208-4_15 ◽

1996 ◽

pp. 226-243 ◽

Author(s):

Jean-Baptiste Joinet ◽

Harold Schellinx ◽

Lorenzo Tortora de Falco

Keyword(s):

Strong Normalization

Download Full-text

A tableau calculus for minimal model reasoning

Theorem Proving with Analytic Tableaux and Related Methods - Lecture Notes in Computer Science ◽

10.1007/3-540-61208-4_18 ◽

1996 ◽

pp. 278-294 ◽

Author(s):

Ilkka Niemelä

Keyword(s):

Download Full-text

Sequent calculi for default and autoepistemic logics

Theorem Proving with Analytic Tableaux and Related Methods - Lecture Notes in Computer Science ◽

10.1007/3-540-61208-4_9 ◽

1996 ◽

pp. 127-142 ◽

Author(s):

Piero A. Bonatti

Keyword(s):

Sequent Calculi

Download Full-text

Proof-search in intuitionistic logic based on constraint satisfaction

Theorem Proving with Analytic Tableaux and Related Methods - Lecture Notes in Computer Science ◽

10.1007/3-540-61208-4_20 ◽

1996 ◽

pp. 312-329 ◽

Author(s):

Andrei Voronkov

Keyword(s):

Intuitionistic Logic ◽

Constraint Satisfaction ◽

Download Full-text

Interpolation for a sequent calculus of generalized quantifiers

Theorem Proving with Analytic Tableaux and Related Methods - Lecture Notes in Computer Science ◽

10.1007/3-540-61208-4_3 ◽

1996 ◽

pp. 36-47

Author(s):

Natasha Alechina

Keyword(s):

Sequent Calculus ◽

Generalized Quantifiers

Download Full-text

A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits

Theorem Proving with Analytic Tableaux and Related Methods - Lecture Notes in Computer Science ◽

10.1007/3-540-61208-4_17 ◽

1996 ◽

pp. 261-277 ◽

Author(s):

Michael Mendler

Keyword(s):

Timing Analysis ◽

Combinational Circuits

Download Full-text

T-string unification: Unifying prefixes in non-classical proof methods

Theorem Proving with Analytic Tableaux and Related Methods - Lecture Notes in Computer Science ◽

10.1007/3-540-61208-4_16 ◽

1996 ◽

pp. 244-260 ◽

Author(s):

Jens Otten ◽

Christoph Kreitz

Keyword(s):

Proof Methods ◽

Classical Proof

Download Full-text