1 option
Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX'99, Saratoga Springs, NY, USA, June 7-11, 1999, Proceedings / edited by Neil V. Murray.
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 ; 1617.
- Lecture Notes in Artificial Intelligence ; 1617
- Language:
- English
- Subjects (All):
- Artificial intelligence.
- Natural language processing (Computer science).
- Logic, Symbolic and mathematical.
- Artificial Intelligence.
- Natural Language Processing (NLP).
- Mathematical Logic and Formal Languages.
- Local Subjects:
- Artificial Intelligence.
- Natural Language Processing (NLP).
- Mathematical Logic and Formal Languages.
- Physical Description:
- 1 online resource (X, 334 pages).
- Edition:
- First edition 1999.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-48754-8
- 9783540487548
- 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.