LEADER 04332nam  22006855  450 
001 996465834403316
005 20200704165752.0
024 7 $a10.1007/11559306
035   $a(CKB)1000000000213273
035   $a(SSID)ssj0000317807
035   $a(PQKBManifestationID)11240624
035   $a(PQKBTitleCode)TC0000317807
035   $a(PQKBWorkID)10308073
035   $a(PQKB)11022526
035   $a(DE-He213)978-3-540-31730-2
035   $a(MiAaPQ)EBC3067567
035   $a(PPN)123097738
035   $a(EXLCZ)991000000000213273
100   $a20100316d2005      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aFrontiers of Combining Systems$b[electronic resource] $e5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings /$fedited by Bernhard Gramlich
205   $a1st ed. 2005.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005.
215   $a1 online resource (X, 321 p.)
225 1 $aLecture Notes in Artificial Intelligence ;$v3717
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$aPrinted edition: 9783540290513 
320   $aIncludes bibliographical references and index.
327   $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.
410  0$aLecture Notes in Artificial Intelligence ;$v3717
606   $aComputers
606   $aArtificial intelligence
606   $aMathematical logic
606   $aComputer programming
606   $aSoftware engineering
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010
606   $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029
615  0$aComputers.
615  0$aArtificial intelligence.
615  0$aMathematical logic.
615  0$aComputer programming.
615  0$aSoftware engineering.
615 14$aTheory of Computation.
615 24$aArtificial Intelligence.
615 24$aMathematical Logic and Formal Languages.
615 24$aProgramming Techniques.
615 24$aSoftware Engineering.
676   $a511.3
702   $aGramlich$b Bernhard$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465834403316
996   $aFrontiers of Combining Systems$92555154
997   $aUNISA