Automated reasoning with analytic tableaux and related methods : International Conference, TABLEAUX 2000, St Andrews, Scotland, UK, July 3-7, 2000 : proceedings
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science. Lecture notes in artificial intelligence
1847 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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 |
| LEADER | 04719nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 970785 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155196405 | ||
| 020 | |a 9783540450085 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Workshop on Theorem Proving with Analytic Tableaux and Related Methods |d (2000 |c :St Andrew, Royaume-Uni). | |
| 245 | 1 | 0 | |a Automated reasoning with analytic tableaux and related methods : |b International Conference, TABLEAUX 2000, St Andrews, Scotland, UK, July 3-7, 2000 : proceedings |c [edited by] Roy Dyckhoff. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science. Lecture notes in artificial intelligence |v 1847 |x 1611-3349 |x 2945-9141 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Théorèmes |x Démonstration automatique | ||
| 650 | |a Raisonnement | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Dyckhoff, Roy, |d 1948- |4 pbd | |
| 776 | 0 | |0 051992140 |t Automated reasoning with analytic tableaux and related methods |o international conference, TABLEAUX 2000, St Andrews, Scotland, UK, July 3-7, 2000 |o proceedings |f Roy Dyckhoff (ed.) |d 2000 |c New York |n Springer |p 1 vol. (X-440 p.) |s Lecture notes in computer science |z 3-540-67697-X | |
| 776 | 0 | |t Automated Reasoning with Analytic Tableaux and Related Methods |b Texte imprimé |z 9783662201763 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/10722086 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-R7CK3C1G-6 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750601043 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/10722086 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753961598 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/10722086 |z Accès INSA CVL | |
| 997 | |0 970785 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||