1 option
Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX 2000 St Andrews, Scotland, UK, July 3-7, 2000 Proceedings / edited by Roy Dyckhoff.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence ; 1847.
- Lecture Notes in Artificial Intelligence ; 1847
- Language:
- English
- Subjects (All):
- Artificial intelligence.
- Programming languages (Electronic computers).
- Logic, Symbolic and mathematical.
- Artificial Intelligence.
- Programming Languages, Compilers, Interpreters.
- Mathematical Logic and Formal Languages.
- Local Subjects:
- Artificial Intelligence.
- Programming Languages, Compilers, Interpreters.
- Mathematical Logic and Formal Languages.
- Physical Description:
- 1 online resource (X, 440 pages).
- Edition:
- First edition 2000.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
- System Details:
- text file PDF
- Contents:
- 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 Representation Framework 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45008-5
- 9783540450085
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.