LEADER 05446nam 22007815 450 001 996465654103316 005 20200704101825.0 010 $a3-540-38401-4 024 7 $a10.1007/3-540-54487-9 035 $a(CKB)1000000000233703 035 $a(SSID)ssj0000322123 035 $a(PQKBManifestationID)11246245 035 $a(PQKBTitleCode)TC0000322123 035 $a(PQKBWorkID)10289099 035 $a(PQKB)11508594 035 $a(DE-He213)978-3-540-38401-4 035 $a(PPN)155224387 035 $a(EXLCZ)991000000000233703 100 $a20121227d1991 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic$b[electronic resource] $e4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990. Proceedings /$fedited by Egon Börger, Hans Kleine Büning, Michael M. Richter, Wolfgang Schönfeld 205 $a1st ed. 1991. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1991. 215 $a1 online resource (VIII, 402 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v533 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-54487-9 327 $aMonadic second order logic, tree automata and forbidden minors -- On the reduction theory for average case complexity -- From prolog algebras towards WAM-A mathematical study of implementation -- A formal operational semantics for languages of type Prolog III -- Efficiency considerations on goal-directed forward chaining for logic programs -- Decision problems for tarski and presburger arithmetics extended with sets -- A fast garbage collection algorithm for WAM ? based PROLOG -- A resolution variant deciding some classes of clause sets -- Subclasses of quantified boolean formulas -- Algorithmic proof with diminishing resources part 1 -- Cutting plane versus frege proof systems -- RAM with compact memory: a realistic and robust model of computation -- Randomness and turing reducibility restraints -- Towards an efficient tableau proof procedure for multiple-valued logics -- Interactive proof systems: Provers, rounds, and error bounds -- Logics for belief dependence -- A generalization of stability and its application to circumscription of positive introspective knowledge -- The complexity of adaptive error-correcting codes -- Ramsey's theorem in bounded arithmetic -- Nontrivial lower bounds for some NP-problems on directed graphs -- Expansions and models of autoepistemic theories -- On the existence of fixpoints in moore's autoepistemic logic and the non-monotonic logic of McDermott and Doyle -- On the tracking of loops in automated deductions -- The gap-language-technique revisited. 330 $aThe workshop Computer Science Logic '90 was held at the Max-Planck-Haus in Heidelberg, Germany, October 1-5, 1990. It was the fourth in a series of worskhops, following CSL '89 at the University of Kaiserslautern (see LNCS 440), CSL '88 at the University of Duisberg (see LNCS 385), and CSL '87 at the University of Karlsruhe (see LNCS 329). This volume contains 24 papers, chosen by means of a review procedure from the 35 papers presented at the workshop, some of which were invited and some selected from a total of 89 submissions. The papers cover a wide range of topics arising from the applications of logic to computer science. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v533 606 $aMathematical logic 606 $aApplied mathematics 606 $aEngineering mathematics 606 $aComputers 606 $aComputer logic 606 $aAlgorithms 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aApplications of Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M13003 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 615 0$aMathematical logic. 615 0$aApplied mathematics. 615 0$aEngineering mathematics. 615 0$aComputers. 615 0$aComputer logic. 615 0$aAlgorithms. 615 14$aMathematical Logic and Foundations. 615 24$aApplications of Mathematics. 615 24$aTheory of Computation. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aAlgorithm Analysis and Problem Complexity. 676 $a004 702 $aBörger$b Egon$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKleine Büning$b Hans$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRichter$b Michael M$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSchönfeld$b Wolfgang$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWorkshop on Computer Science Logic 906 $aBOOK 912 $a996465654103316 996 $aComputer Science Logic$9771972 997 $aUNISA