000 03703nam a22005775i 4500
001 978-3-642-37651-1
003 DE-He213
005 20200421111154.0
007 cr nn 008mamaa
008 130406s2013 gw | s |||| 0|eng d
020 _a9783642376511
_9978-3-642-37651-1
024 7 _a10.1007/978-3-642-37651-1
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aProgramming Logics
_h[electronic resource] :
_bEssays in Memory of Harald Ganzinger /
_cedited by Andrei Voronkov, Christoph Weidenbach.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aX, 447 p. 69 illus.
_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 ;
_v7797
505 0 _aHarald Ganzinger's Legacy: Contributions to Logics and Programming -- Bio-Logics: Logical Analysis of Bioregulatory Networks -- Canonical Ground Horn Theories -- Generic Functional Representation of Sorted Trees Supporting Attribution (Haskell Can Do It) -- The Blossom of Finite Semantic Trees -- Functional Logic Programming: From Theory to Curry -- From Search to Computation: Redundancy Criteria and Simplification at Work -- Elimination Techniques for Program Analysis -- Narrowing Based Inductive Proof Search -- Inst-Gen - A Modular Approach to Instantiation-Based Automated Reasoning -- Common Knowledge Logic in a Higher Order Proof Assistant -- Constructing Bachmair-Ganzinger Models -- Planning with Effectively Propositional Logic -- The Relative Power of Semantics and Unification -- First-Order Resolution Methods for Modal Logics -- On Combinations of Local Theory Extensions -- Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs.
520 _aThis Festschrift volume, published in memory of Harald Ganzinger, contains 17 papers from colleagues all over the world and covers all the fields to which Harald Ganzinger dedicated his work during his academic career. The volume begins with a complete account of Harald Ganzinger's work and then turns its focus to the research of his former colleagues, students, and friends who pay tribute to him through their writing. Their individual papers span a broad range of topics, including programming language semantics, analysis and verification, first-order and higher-order theorem proving, unification theory, non-classical logics, reasoning modulo theories, and applications of automated reasoning in biology.
650 0 _aComputer science.
650 0 _aComputer programming.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aArtificial intelligence.
650 0 _aComputer graphics.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aProgramming Techniques.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aComputer Imaging, Vision, Pattern Recognition and Graphics.
700 1 _aVoronkov, Andrei.
_eeditor.
700 1 _aWeidenbach, Christoph.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642376504
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7797
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-37651-1
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c53407
_d53407