Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th TABLEAUX 1999: Saratoga Springs, NY, USA
- Neil V. Murray:
Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX '99, Saratoga Springs, NY, USA, June 7-11, 1999, Proceedings. Lecture Notes in Computer Science 1617, Springer 1999, ISBN 3-540-66086-0
Extended Abstracts of Invited Lectures
- Randal E. Bryant, Steven M. German, Miroslav N. Velev
:
Microprocessor Verification Using Efficient Decision Procedures for a Logic of Equality with Uninterpreted Functions. 1-13
Comparison
- Fabio Massacci:
Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison. 14-18 - Peter F. Patel-Schneider, Ian Horrocks:
DLP and FaCT. 19-23 - Volker Haarslev, Ralf Möller:
Applying an ALC ABox Consistency Tester to Modal Logic SAT Problems. 24-28 - Vijay Boyapati, Rajeev Goré:
KtSeqC: System Description. 29-31
Abstracts of Tutorials
- Fabio Massacci:
Automated Reasoning and the Verification of Security Protocols. 32-33 - Reiner Hähnle, Bernhard Beckert:
Proof Confluent Tableau Calculi. 34-35
Contributed Research Papers
- Matthias Baaz, Christian G. Fermüller:
Analytic Calculi for Projective Logics. 36-50 - Peter Baumgartner, Joseph Douglas Horton, Bruce Spencer:
Merge Path Improvements for Minimal Model Hyper Tableaux. 51-65 - Krysia Broda, Dov M. Gabbay:
CLDS for Propositional Intuitionistic Logic. 66-81 - James L. Caldwell:
Intuitionistic Tableau Extracted. 82-96 - Domenico Cantone, Calogero G. Zarba:
A Tableau-Based Decision Procedure for a Fragment of Set Theory Involving a Restricted Form of Quantification. 97-112 - Agata Ciabattoni:
Bounded Contraction in Systems with Linearity. 113-127 - Philippe de Groote:
The Non-Associative Lambek Calculus with Product in Polynomial Time. 128-139 - Stéphane Demri:
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization? 140-154 - Stéphane Demri, Rajeev Goré:
Cut-Free Display Calculi for Nominal Tense Logics. 155-170 - Martin Giese, Wolfgang Ahrendt:
Hilbert's epsilon-Terms in Automated Theorem Proving. 171-185 - Paul C. Gilmore:
Partial Functions in an Impredicative Simple Theory of Types. 186-201 - Jean Goubault-Larrecq:
A Simple Sequent System for First-Order Logic with Free Constructors. 202-216 - Heiko Mantel, Jens Otten:
linTAP: A Tableau Prover for Linear Logic. 217-231 - Wolfgang May:
A Tableau Calculus for a Temporal Logic with Temporal Connectives. 232-246 - Christof Monz, Maarten de Rijke:
A Tableau Calculus for Pronoun Resolution. 247-262 - Heribert Schütz:
Generating Minimal Herbrand Models Step by Step. 263-277 - Miroslava Tzakova:
Tableau Calculi for Hybrid Logics. 278-292 - Claus-Peter Wirth:
Full First-Order Free Variable Sequents and Tableaux in Implicit Induction. 293-307
Contributed System Descriptions
- Ulrich Endriss:
An Interactive Theorem Proving Assistant. 308-312 - Ulrich Endriss:
A Time Efficient KE Based Theorem Prover. 313-318 - Andreas Wolf, Joachim Draeger:
Strategy Parallel Use of Model Elimination with Lemmata (System Abstract). 319-323
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-22 21:11 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:
