Automated reasoning with analytic tableaux and related methods : International Conference, TABLEAUX 2000, St Andrews, Scotland, UK, July 3-7, 2000 : proceedings
Αποθηκεύτηκε σε:
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Livre numérique |
| Γλώσσα: | Anglais |
| Έκδοση: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Σειρά: | Lecture notes in computer science. Lecture notes in artificial intelligence
1847 |
| Θέματα: | |
| Διαθέσιμο Online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Σημείωση: |
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 2000, St Andrews, Scotland, UK, July 3-7, 2000, proceedings, Roy Dyckhoff (ed.), 2000, New York, Springer, 1 vol. (X-440 p.), Lecture notes in computer science, 3-540-67697-X • Automated Reasoning with Analytic Tableaux and Related Methods, Texte imprimé, 9783662201763 |
Πίνακας περιεχομένων:
- Invited Lectures
- Tableau Algorithms for Description Logics
- Modality and Databases
- Local Symmetries in Propositional Logic
- Comparison
- Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison
- Consistency Testing: The RACE Experience
- Benchmark Analysis with FaCT
- MSPASS: Modal Reasoning by Translation and First-Order Resolution
- TANCS-2000 Results for DLP
- Evaluating *SAT on TANCS 2000 Benchmarks
- Research Papers
- A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations
- A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus
- An Analytic Calculus for Quantified Propositional Gödel Logic
- A Tableau Method for Inconsistency-Adaptive Logics
- A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning
- Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics
- Variants of First-Order Modal Logics
- Complexity of Simple Dependent Bimodal Logics
- Properties of Embeddings from Int to S4
- Term-Modal Logics
- A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics
- Dual Intuitionistic Logic Revisited
- Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions
- Search Space Compression in Connection Tableau Calculi Using Disjunctive Constraints
- Matrix-Based Inductive Theorem Proving
- Monotonic Preorders for Free Variable Tableaux
- The Mosaic Method for Temporal Logics
- Sequent-Like Tableau Systems with the Analytic Superformula Property for the Modal Logics KB, KDB, K5, KD5
- A Tableau Calculus for Equilibrium Entailment
- Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory
- Tableau Calculus for Only Knowing and Knowing At Most
- A Tableau-Like RepresentationFramework for Efficient Proof Reconstruction
- The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson s Arithmetic Q
- System Descriptions
- Redundancy-Free Lemmatization in the Automated Model-Elimination Theorem Prover AI-SETHEO
- E-SETHEO: An Automated3 Theorem Prover.