Automated reasoning with analytic tableaux and related methods : international conference, TABLEAUX'99, Saratoga Springs, NY, June 7-11, 1999 : proceedings
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science. Lecture notes in artificial intelligence
1617 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Automated reasoning with analytic tableaux and related methods, international conference, TABLEAUX'99, Saratoga Springs, NY, June 7-11, 1999, proceedings, Neil V. Murray (ed.), 1999, Berlin, Springer, 1 vol. (X-323 p.), Lecture notes in computer science, 3-540-66086-0 • Automated Reasoning with Analytic Tableaux and Related Methods, Texte imprimé, 9783662162279 |
Table des matières:
- Extended Abstracts of Invited Lectures
- Microprocessor Verification Using Efficient Decision Procedures for a Logic of Equality with Uninterpreted Functions
- Comparison
- Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison
- DLP and FaCT
- Applying an ABox Consistency Tester to Modal Logic SAT Problems
- KtSeqC : System Description
- Abstracts of Tutorials
- Automated Reasoning and the Verification of Security Protocols
- Proof Confluent Tableau Calculi
- Contributed Research Papers
- Analytic Calculi for Projective Logics
- Merge Path Improvements for Minimal Model Hyper Tableaux
- CLDS for Propositional Intuitionistic Logic
- Intuitionisitic Tableau Extracted
- A Tableau-Based Decision Procedure for a Fragment of Set Theory Involving a Restricted Form of Quantification
- Bounded Contraction in Systems with Linearity
- The Non-associative Lambek Calculus with Product in Polynomial Time
- Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?
- Cut-Free Display Calculi for Nominal Tense Logics
- Hilbert s ?-Terms in Automated Theorem Proving
- Partial Functions in an Impredicative Simple Theory of Types
- A Simple Sequent System for First-Order Logic with Free Constructors
- linTAP : A Tableau Prover for Linear Logic
- A Tableau Calculus for a Temporal Logic with Temporal Connectives
- A Tableau Calculus for Pronoun Resolution
- Generating Minimal Herbrand Models Step by Step
- Tableau Calculi for Hybrid Logics
- Full First-Order Free Variable Sequents and Tableaux in Implicit Induction
- Contributed System Descriptions
- An Interactive Theorem Proving Assistant
- A Time Efficient KE Based Theorem Prover
- Strategy Parallel Use of Model Elimination with Lemmata.