Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar5. TABLEAUX 1996: Terrasini, Palermo, Italy
Pierangelo Miglioli, Ugo Moscato, Daniele Mundici, Mario Ornaghi:
Theorem Proving with Analytic Tableaux and Related Methods, 5th International Workshop, TABLEAUX '96, Terrasini, Palermo, Italy, May 15-17, 1996, Proceedings. Lecture Notes in Computer Science 1071, Springer 1996, ISBN 3-540-61208-4
Invited Lectures
Contributed Papers
- Alessandro Avellone, Mauro Ferrari:
Almost Duplication-Free Tableau Calculi for Propositional Lax Logics. 48-64 - Bernhard Beckert, Christian Pape:
Incremental Theory Reasoning Methods for Semantic Tableaux. 93-109 - Jean-Paul Billon:
The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework. 110-126 - François Bry, Adnan H. Yahya:
Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux. 143-159 - Bertram Fronhöfer:
Situational Calculus, Linear Connection Proofs and STRIPS-like Planning: An Experimental Comparison. 193-209 - Alain Heuerding, Michael Seyfried, Heinrich Zimmermann:
Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics. 210-225 - Jean-Baptiste Joinet, Harold Schellinx, Lorenzo Tortora de Falco:
Strong Normalization for All-Style LK. 226-243 - Jens Otten, Christoph Kreitz:
T-String Unification: Unifying Prefixes in Non-classical Proof Methods. 244-260 - Michael Mendler:
A Timing Refinement of Intuitionistic Proofs and its Application to the Timing Analysis of Combinational Circuits. 261-277 - Eike Ritter, David J. Pym, Lincoln A. Wallen:
On the Intuitionistic Force of Classical Search (Extended Abstract). 295-311
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-20 21:43 CEST by the dblp team