03387nam 2200529 a 450 991048477620332120200520144314.010.1007/11559306(CKB)1000000000213273(SSID)ssj0000317807(PQKBManifestationID)11240624(PQKBTitleCode)TC0000317807(PQKBWorkID)10308073(PQKB)11022526(DE-He213)978-3-540-31730-2(MiAaPQ)EBC3067567(PPN)123097738(EXLCZ)99100000000021327320050819d2005 uy 0engurnn#008mamaatxtccrFrontiers of combining systems 5th international workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005 : proceedings /Bernhard Gramlich (ed.)1st ed. 2005.Berlin ;New York Springerc20051 online resource (X, 321 p.)Lecture notes in computer science. Lecture notes in artifical intelligence,0302-9743 ;3717Bibliographic Level Mode of Issuance: MonographPrinted edition: 9783540290513 Includes bibliographical references and index.Logics, 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.Lecture notes in computer science.Lecture notes in artificial intelligence ;3717.FroCoS 2005Logic, Symbolic and mathematicalCongressesComputer scienceCongressesLogic, Symbolic and mathematicalComputer science511.3MiAaPQMiAaPQMiAaPQBOOK9910484776203321Frontiers of Combining Systems2555154UNINA