LEADER 06139nam 22007695 450 001 9910485011003321 005 20200701080627.0 010 $a3-642-40885-0 024 7 $a10.1007/978-3-642-40885-4 035 $a(CKB)3710000000019163 035 $a(SSID)ssj0001010869 035 $a(PQKBManifestationID)11933218 035 $a(PQKBTitleCode)TC0001010869 035 $a(PQKBWorkID)11002774 035 $a(PQKB)11773178 035 $a(DE-He213)978-3-642-40885-4 035 $a(MiAaPQ)EBC3093376 035 $a(PPN)172430178 035 $a(EXLCZ)993710000000019163 100 $a20130911d2013 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFrontiers of Combining Systems$b[electronic resource] $e9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013, Proceedings /$fedited by Pascal Fontaine, Christophe Ringeissen, Renate Schmidt 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XII, 359 p. 35 illus.) 225 1 $aLecture Notes in Artificial Intelligence ;$v8152 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-40884-2 327 $aInvited Talk 1 -- MetiTarski?s Menagerie of Cooperating Systems -- Inductive Theorem Proving -- Combining Superposition and Induction: A Practical Realization -- Arrays and Memory Access Optimization -- Definability of Accelerated Relations in a Theory of Arrays and Its Applications -- Verification of Composed Array-Based Systems with Applications to Security-Aware Workflows -- Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages -- Approximation and Forgetting -- Roughening the EL Envelope -- Uniform Interpolation of ALC-Ontologies Using Fixpoints -- Abduction in Logic Programming as Second-Order Quantifier Elimination -- Invited Talk 2 -- Witness Runs for Counter Machines -- Temporal and Description Logic Techniques -- Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders -- Temporal Query Answering in the Description Logic DL-Lite -- Verification of Golog Programs over Description Logic Actions -- Invited Talk 3 -- Specification and Verification of Linear Dynamical Systems: Advances and Challenges -- Theorem Proving with Theories and Sorts -- Obtaining Finite Local Theory Axiomatizations via Saturation -- Non-cyclic Sorts for First-Order Satisfiability -- Detection of First Order Axiomatic Theories -- Mechanizing the Metatheory of Sledgehammer -- Invited Talk 4 -- From Resolution and DPLL to Solving Arithmetic Constraints -- Modal Logic and Description Logic -- Tableaux for Relation-Changing Modal Logics -- Computing Minimal Models Modulo Subset-Simulation for Modal Logics -- Hybrid Unification in the Description Logic EL -- Rewriting -- Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering -- On Forward Closure and the Finite Variant Property -- Term Rewriting with Logical Constraints. 330 $aThis book constitutes the refereed proceedings of the 9th International Symposium on Frontiers of Combining Systems, FroCoS 2013, held in Nancy, France, in September 2013. The 20 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 33 submissions. FroCoS'13 seeks to offer a common forum for research in the general area of combination,modularization and integration of systems, with emphasis on logic-based ones, and of their practical use.  Typical topics of interest include following subjects: combinations of logics such as combined predicate, temporal, modal or epistemic logics, combinations and modularity in ontologies, combination of decision, procedures, of satisfiability, procedures and of constraint solving techniques, combinations and modularity in term rewriting, integration of equational and other theories into deductive systems, combination of deduction systems and computer algebra, integration of data structures into constraint logic programming and deduction, and modularizing programs and specifications. 410 0$aLecture Notes in Artificial Intelligence ;$v8152 606 $aArtificial intelligence 606 $aMathematical logic 606 $aComputer logic 606 $aSoftware engineering 606 $aAlgorithms 606 $aComputer programming 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 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 0$aComputer logic. 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aComputer programming. 615 14$aArtificial Intelligence. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 615 24$aSoftware Engineering. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aProgramming Techniques. 676 $a006.3 702 $aFontaine$b Pascal$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRingeissen$b Christophe$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSchmidt$b Renate$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910485011003321 996 $aFrontiers of Combining Systems$9772665 997 $aUNINA