Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX'99, Saratoga Springs, NY, USA, June 7-11, 1999, Proceedings . / Lecture Notes in Artificial Intelligence 1617)

Neil V. Murray

ISBN 10: 3540660860 / ISBN 13: 9783540660866

Editore: Springer, 1999

Riguardo questo articolo

*FREE DOMESTIC SHIPPING until Monday, June 30* 323 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Codice articolo ZB716326

Dati bibliografici

• Titolo: Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX'99, Saratoga Springs, NY, USA, June 7-11, 1999, Proceedings . / Lecture Notes in Artificial Intelligence 1617)
• Editore: Springer
• Data di pubblicazione: 1999
• Lingua: Inglese
• ISBN 10: 3540660860
• ISBN 13: 9783540660866
• Rilegatura: Brossura
• Condizione: Good

Descrizione articolo

Riassunto

ThisvolumecontainsaselectionofpaperspresentedattheInternationalConf- ence on Analytic Tableaux and Related Methods (TABLEAUX 99) held on June 7-11, 1999 at the Inn at Saratoga, Saratoga Springs, NY, USA. This conference was the continuation of international meetings on Theorem Proving with A- lytic Tableaux and Related Methods held in Lautenbach near Karlsruhe (1992), Marseille (1993), Abingdon near Oxford (1994), St. Goar near Koblenz (1995), Terrasini near Palermo (1996), Pont-` a-Mousson near Nancy (1997), and Oist- wijk near Tilburg (1998). TABLEAUX 99 marks the ?rst time the conference has been held in North America. Tableau and related methods have been found to be convenient and e?ective for automating deduction in various non-standard logics as well as in classical logic. Examples taken from this meeting alone include temporal, description, tense, quantum, modal, projective, hybrid, intuitionistic, and linear logics. - eas of application include veri?cation of software and computer systems, ded- tive databases, knowledge representation and its required inference engines, and system diagnosis. The conference brought together researchers interested in all aspects theoretical foundations, implementation techniques, systems devel- ment and applications of the mechanization of reasoning with tableaux and related methods.

Contenuti

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.