LEADER 05229nam 22007335 450 001 996465728803316 005 20200701112310.0 010 $a3-540-46736-X 024 7 $a10.1007/BFb0026291 035 $a(CKB)1000000000233455 035 $a(SSID)ssj0000322406 035 $a(PQKBManifestationID)11238718 035 $a(PQKBTitleCode)TC0000322406 035 $a(PQKBWorkID)10289015 035 $a(PQKB)11529423 035 $a(DE-He213)978-3-540-46736-6 035 $a(PPN)155233726 035 $a(EXLCZ)991000000000233455 100 $a20121227d1989 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCSL'88$b[electronic resource] $e2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988. Proceedings /$fedited by Egon Börger, Hans Kleine Büning, Michael M. Richter 205 $a1st ed. 1989. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1989. 215 $a1 online resource (VIII, 404 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v385 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-51659-X 327 $aOn disjunctive self-reducibility -- The knowledge representation language LLILOG -- Completeness with respect to interpretations in deterministic and nondeterministic polynomial time -- A temporal logic approach to specify and to prove properties of finite state concurrent systems -- A comparison of the resolution calculus and the connection method, and a new calculus generalizing both methods -- Characterizing complexity classes by general recursive definitions in higher types -- Size of models versus length of computations -- Boolean circuit complexity of algebraic interpolation problems -- Loop detection in propositional Prolog programs -- Numberings of R1?F -- Interval temporal logic and star-free expressions -- An interpreter with lazy evaluation for Prolog with functions -- On the complexity of the decision problem in propositional nonmonotonic logic -- Gentzen-Systems for propositional temporal logics -- Predicate inequalities as a basis for automated termination proofs for Prolog programs -- On the existence of fair schedulers -- Using finite-linear temporal logic for specifying database dynamics -- Is average superlinear speedup possible? -- Enforcement of integrity constraints in a semantic data model -- Delete operations and Horn formulas -- Integration of descriptive and procedural language constructs -- Normal forms and the complexity of computations of logic programs -- A remark on minimal polynomials of Boolean functions -- On the emptiness problem of tree automata and completeness of modal logics of programs. 330 $aThis volume contains the papers which were presented at the second workshop "Computer Science Logic" held in Duisburg, FRG, October 3-7, 1988. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science: e.g. in complexity, data base theory, logic programming, artificial intelligence, and concurrency. The volume should be of interest to all logicians and computer scientists working in the above fields. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v385 606 $aArchitecture, Computer 606 $aMathematical logic 606 $aProgramming languages (Electronic computers) 606 $aComputer logic 606 $aCombinatorics 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 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 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aArchitecture, Computer. 615 0$aMathematical logic. 615 0$aProgramming languages (Electronic computers). 615 0$aComputer logic. 615 0$aCombinatorics. 615 14$aComputer System Implementation. 615 24$aMathematical Logic and Foundations. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aCombinatorics. 676 $a003.3 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 906 $aBOOK 912 $a996465728803316 996 $aCSL'88$92830561 997 $aUNISA