LEADER 03582oam 2200553 450 001 996465333503316 005 20210715123747.0 010 $a3-540-48754-9 024 7 $a10.1007/3-540-48754-9 035 $a(CKB)1000000000211179 035 $a(SSID)ssj0000321542 035 $a(PQKBManifestationID)11937828 035 $a(PQKBTitleCode)TC0000321542 035 $a(PQKBWorkID)10280128 035 $a(PQKB)11453742 035 $a(DE-He213)978-3-540-48754-8 035 $a(MiAaPQ)EBC3072444 035 $a(MiAaPQ)EBC6485877 035 $a(PPN)155230999 035 $a(EXLCZ)991000000000211179 100 $a20210715d1999 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aAutomated reasoning with analytic tableaux and related methods $einternational conference, TABLEAUX'99, Saratoga Springs, NY, June 7-11, 1999 : proceedings /$fNeil V. Murray, editor 205 $a1st ed. 1999. 210 1$aBerlin ;$aHeidelberg :$cSpringer Verlag,$d[1999] 210 4$d©1999 215 $a1 online resource (X, 334 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v1617 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-66086-0 320 $aIncludes bibliographical references and index. 327 $aExtended 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. 410 0$aLecture Notes in Artificial Intelligence ;$v1617 606 $aAutomatic theorem proving$vCongresses 615 0$aAutomatic theorem proving 676 $a511.3 702 $aMurray$b Neil V. 712 12$aTABLEAUX '99 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996465333503316 996 $aAutomated Reasoning with Analytic Tableaux and Related Methods$92556460 997 $aUNISA LEADER 01047cam0-22003851i-450 001 990001667660403321 005 20250404174330.0 035 $a000166766 035 $aFED01000166766 035 $a(Aleph)000166766FED01 100 $a20030910d1869----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $a 001yy 200 1 $aAlessandro di Humboldt$ebiografia$fOttone Ule 210 $aTorino ; Napoli$cUTET$d1869 215 $a149 p.$d19 cm 610 0 $aScienziati 610 0 $aHumboldt, Alexander von 610 0 $aBiografia 676 $a925 700 1$aUle,$bOttone$0354132 702 1$aHumboldt,$bAlexander von$f<1769-1859> 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990001667660403321 952 $a60 DONO IERNA 293$b36042$fFAGBC 952 $aA MUSA 43$b03/2694/25$fFAGBC 952 $aComes$bJ200$fDAGBO 952 $a5/XII B 15$bbibl.13872$fFLFBC 959 $aFLFBC 959 $aFAGBC 959 $aDAGBO 996 $aAlessandro di Humboldt$9370307 997 $aUNINA