000 04086nam a22006135i 4500
001 978-3-642-37651-1
003 DE-He213
005 20240730192035.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 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
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.
250 _a1st ed. 2013.
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 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_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 _aMachine theory.
_9148368
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer programming.
_94169
650 0 _aComputer science.
_99832
650 0 _aImage processing
_xDigital techniques.
_94145
650 0 _aComputer vision.
_9148369
650 1 4 _aFormal Languages and Automata Theory.
_9148370
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aProgramming Techniques.
_9148371
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aComputer Imaging, Vision, Pattern Recognition and Graphics.
_931569
700 1 _aVoronkov, Andrei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148372
700 1 _aWeidenbach, Christoph.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148373
710 2 _aSpringerLink (Online service)
_9148374
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642376504
776 0 8 _iPrinted edition:
_z9783642376528
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v7797
_9148375
856 4 0 _uhttps://doi.org/10.1007/978-3-642-37651-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94043
_d94043