000 04289nam a22006255i 4500
001 978-3-540-46736-6
003 DE-He213
005 20160624102017.0
007 cr nn 008mamaa
008 121227s1989 gw | s |||| 0|eng d
020 _a9783540467366
_9978-3-540-46736-6
024 7 _a10.1007/BFb0026291
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 0 _aCSL '88
_h[electronic resource] :
_b2nd Workshop on Computer Science Logic Duisburg, FRG, October 3–7, 1988 Proceedings /
_cedited by Egon Börger, Hans Kleine Büning, Michael M. Richter.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
300 _aVIII, 404 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v385
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aLogic design.
650 0 _aDatabase management.
650 0 _aArtificial intelligence.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aCombinatorics.
650 2 4 _aDatabase Management.
650 2 4 _aArtificial Intelligence (incl. Robotics).
700 1 _aBörger, Egon.
_eeditor.
700 1 _aBüning, Hans Kleine.
_eeditor.
700 1 _aRichter, Michael M.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540516590
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v385
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0026291
942 _2EBK5879
_cEBK
999 _c35173
_d35173