000			05188nam a22006257a 4500
001			sulb-eb0025540
003			BD-SySUS
005			20160413122531.0
007			cr nn 008mamaa
008			130911s2013 gw | s |||| 0|eng d
020			_a9783642408854 _9978-3-642-40885-4
024	7		_a10.1007/978-3-642-40885-4 _2doi
050		4	_aQ334-342
050		4	_aTJ210.2-211.495
072		7	_aUYQ _2bicssc
072		7	_aTJFM1 _2bicssc
072		7	_aCOM004000 _2bisacsh
082	0	4	_a006.3 _223
245	1	0	_aFrontiers of Combining Systems _h[electronic resource] : _b9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013. Proceedings / _cedited by Pascal Fontaine, Christophe Ringeissen, Renate A. Schmidt.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013.
300			_aXII, 359 p. 35 illus. _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 Computer Science, _x0302-9743 ; _v8152
505	0		_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.
520			_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.
650		0	_aComputer science.
650		0	_aComputer programming.
650		0	_aSoftware engineering.
650		0	_aAlgorithms.
650		0	_aComputer logic.
650		0	_aMathematical logic.
650		0	_aArtificial intelligence.
650	1	4	_aComputer Science.
650	2	4	_aArtificial Intelligence (incl. Robotics).
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aLogics and Meanings of Programs.
650	2	4	_aSoftware Engineering.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aProgramming Techniques.
700	1		_aFontaine, Pascal. _eeditor.
700	1		_aRingeissen, Christophe. _eeditor.
700	1		_aSchmidt, Renate A. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642408847
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v8152
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-40885-4
912			_aZDB-2-SCS
912			_aZDB-2-LNC
942			_2Dewey Decimal Classification _ceBooks
999			_c47632 _d47632