LEADER 04138nam  22007935  450 
001 9910483346103321
005 20251226195301.0
010   $a3-540-74621-8
024 7 $a10.1007/978-3-540-74621-8
035   $a(CKB)1000000000490595
035   $a(SSID)ssj0000317808
035   $a(PQKBManifestationID)11230713
035   $a(PQKBTitleCode)TC0000317808
035   $a(PQKBWorkID)10295541
035   $a(PQKB)11652150
035   $a(DE-He213)978-3-540-74621-8
035   $a(MiAaPQ)EBC3063305
035   $a(MiAaPQ)EBC6413303
035   $a(PPN)123164745
035   $a(BIP)32374230
035   $a(BIP)14494830
035   $a(EXLCZ)991000000000490595
100   $a20100301d2007      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aFrontiers of Combining Systems $e6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007. Proceedings /$fedited by Boris Konev, Frank Wolter
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (X, 286 p.) 
225 1 $aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v4720
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$a3-540-74620-X 
320   $aIncludes bibliographical references and index.
327   $aSection 1. Invited Contributions -- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL -- From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain -- Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions -- Temporalising Logics: Fifteen Years After -- Section 2. Technical Papers -- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs -- A Compressing Translation from Propositional Resolution to Natural Deduction -- Combining Algorithms for Deciding Knowledge in Security Protocols -- Combining Classical and Intuitionistic Implications -- Towards an Automatic Analysis of Web Service Security -- Certification of Automated Termination Proofs -- Temporal Logic with Capacity Constraints -- Idempotent Transductions for Modal Logics -- A Temporal Logic of Robustness -- Noetherianity and Combination Problems -- Languages Modulo Normalization -- Combining Proof-Producing Decision Procedures -- Visibly Pushdown Languages and Term Rewriting -- Proving Termination Using Recursive Path Orders and SAT Solving.
330   $aThis book constitutes the refereed proceedings of the 6th International Symposium on Frontiers of Combining Systems, FroCoS 2007, held in Liverpool, UK, September 2007. The 14 revised full papers presented were carefully selected and are organized in topical sections on combinations of logics, theories, and decision procedures; constraint solving and programming; combination issues in rewriting and programming as well as in logical frameworks and theorem proving systems.
410  0$aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v4720
606   $aComputer science
606   $aArtificial intelligence
606   $aMachine theory
606   $aComputer programming
606   $aSoftware engineering
606   $aTheory of Computation
606   $aArtificial Intelligence
606   $aFormal Languages and Automata Theory
606   $aProgramming Techniques
606   $aSoftware Engineering
615  0$aComputer science.
615  0$aArtificial intelligence.
615  0$aMachine theory.
615  0$aComputer programming.
615  0$aSoftware engineering.
615 14$aTheory of Computation.
615 24$aArtificial Intelligence.
615 24$aFormal Languages and Automata Theory.
615 24$aProgramming Techniques.
615 24$aSoftware Engineering.
676   $a511.3
702   $aKonev$b Boris
702   $aWolter$b Frank
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910483346103321
996   $aFrontiers of Combining Systems$92555154
997   $aUNINA