000 03760nam a22005775i 4500
001 978-3-540-31730-2
003 DE-He213
005 20240730194450.0
007 cr nn 008mamaa
008 100316s2005 gw | s |||| 0|eng d
020 _a9783540317302
_9978-3-540-31730-2
024 7 _a10.1007/11559306
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aFrontiers of Combining Systems
_h[electronic resource] :
_b5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings /
_cedited by Bernhard Gramlich.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aX, 321 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 Artificial Intelligence,
_x2945-9141 ;
_v3717
505 0 _aLogics, Theories, and Decision Procedures I -- A Comprehensive Framework for Combined Decision Procedures -- Connecting Many-Sorted Structures and Theories Through Adjoint Functions -- Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic -- On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal -- Interface Formalisms -- Sociable Interfaces -- Logics, Theories, and Decision Procedures II -- About the Combination of Trees and Rational Numbers in a Complete First-Order Theory -- A Complete Temporal and Spatial Logic for Distributed Systems -- Constraint Solving and Programming -- Hybrid CSP Solving -- An Efficient Decision Procedure for UTVPI Constraints -- Declarative Constraint Programming with Definitional Trees -- Logical Problem Analysis and Encoding I -- Logical Analysis of Hash Functions -- Combination Issues in Rewriting and Programming -- Proving and Disproving Termination of Higher-Order Functions -- Proving Liveness with Fairness Using Rewriting -- A Concurrent Lambda Calculus with Futures -- Compositional System Design and Refinement -- The ASM Method for System Design and Analysis. A Tutorial Introduction -- Logical Problem Analysis and Encoding II -- Matching Classifications via a Bidirectional Integration of SAT and Linguistic Resources -- Theorem Proving Frameworks and Systems -- Connecting a Logical Framework to a First-Order Logic Prover -- Combination of Isabelle/HOL with Automatic Tools -- ATS: A Language That Combines Programming with Theorem Proving.
650 0 _aComputer science.
_99832
650 0 _aArtificial intelligence.
_93407
650 0 _aMachine theory.
_9157177
650 0 _aComputer programming.
_94169
650 0 _aSoftware engineering.
_94138
650 1 4 _aTheory of Computation.
_9157178
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aFormal Languages and Automata Theory.
_9157179
650 2 4 _aProgramming Techniques.
_9157180
650 2 4 _aSoftware Engineering.
_94138
700 1 _aGramlich, Bernhard.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9157181
710 2 _aSpringerLink (Online service)
_9157182
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540290513
776 0 8 _iPrinted edition:
_z9783540816010
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v3717
_9157183
856 4 0 _uhttps://doi.org/10.1007/11559306
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95215
_d95215