|
|
|
|
LEADER |
03887nam a2200505 4500 |
001 |
978-3-540-48754-8 |
003 |
DE-He213 |
005 |
20191023121644.0 |
007 |
cr nn 008mamaa |
008 |
121227s1999 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540487548
|9 978-3-540-48754-8
|
024 |
7 |
|
|a 10.1007/3-540-48754-9
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a Q334-342
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
072 |
|
7 |
|a UYQ
|2 thema
|
082 |
0 |
4 |
|a 006.3
|2 23
|
245 |
1 |
0 |
|a Automated Reasoning with Analytic Tableaux and Related Methods
|h [electronic resource] :
|b International Conference, TABLEAUX'99, Saratoga Springs, NY, USA, June 7-11, 1999, Proceedings /
|c edited by Neil V. Murray.
|
250 |
|
|
|a 1st ed. 1999.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 1999.
|
300 |
|
|
|a X, 334 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Artificial Intelligence ;
|v 1617
|
505 |
0 |
|
|a 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.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Natural language processing (Computer science).
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
1 |
4 |
|a Artificial Intelligence.
|0 http://scigraph.springernature.com/things/product-market-codes/I21000
|
650 |
2 |
4 |
|a Natural Language Processing (NLP).
|0 http://scigraph.springernature.com/things/product-market-codes/I21040
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|0 http://scigraph.springernature.com/things/product-market-codes/I16048
|
700 |
1 |
|
|a Murray, Neil V.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662162279
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540660866
|
830 |
|
0 |
|a Lecture Notes in Artificial Intelligence ;
|v 1617
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-48754-9
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|