default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th 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
- Peter B. Andrews, Matthew Bishop:
On Sets, Types, Fixed Points, and Checkerboards. 1-15 - Marcello D'Agostino, Dov M. Gabbay:
Fibred Tableaux for Multi-Implication Logic. 16-35
Contributed Papers
- Natasha Alechina:
Interpolation for a Sequent Calculus of Generalized Quantifiers. 36-47 - Alessandro Avellone
, Mauro Ferrari:
Almost Duplication-Free Tableau Calculi for Propositional Lax Logics. 48-64 - Matthias Baaz, Christian G. Fermüller:
Combining Many-valued and Intuitionistic Tableaux. 65-79 - Gérard Becher:
Cyclic Connections. 80-92 - 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 - Piero A. Bonatti:
Sequent Calculi for Default and Autoepistemic Logics. 127-142 - François Bry, Adnan H. Yahya:
Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux. 143-159 - Jeremy V. Pitt, Jim Cunningham:
Distributed Modal Theorem Proving with KE. 160-176 - Stéphane Demri:
A Simple Tableau System for the Logic of Elsewhere. 177-192 - 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 - Ilkka Niemelä:
A Tableau Calculus for Minimal Model Reasoning. 278-294 - Eike Ritter, David J. Pym, Lincoln A. Wallen:
On the Intuitionistic Force of Classical Search (Extended Abstract). 295-311 - Andrei Voronkov:
Proof-Search in Intuitionistic Logic Based on Constraint Satisfaction. 312-329
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-10-08 20:41 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:
