000 04379nam a22004935i 4500
001 978-3-540-45988-0
003 DE-He213
005 20160624102010.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540459880
_9978-3-540-45988-0
024 7 _a10.1007/3-540-45988-X
_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] :
_b4th International Workshop, FroCoS 2002 Santa Margherita Ligure, Italy, April 8–10, 2002 Proceedings /
_cedited by Alessandro Armando.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
300 _aVIII, 264 p.
_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 ;
_v2309
505 0 _aFoundations of a Constraint-Based Illustrator -- Integrating HOL-CASL into the Development Graph Manager MAYA -- Monads and Modularity -- A Modular Approach to Proving Confluence -- Integrating BDD-Based and SAT-Based Symbolic Model Checking -- Heuristics for Efficient Manipulation of Composite Constraints -- Constraint-Based Model Checking for Parameterized Synchronous Systems -- A Rewrite Rule Based Framework for Combining Decision Procedures * -- Combining Sets with Integers -- Solving Nonlinear Equations by Abstraction, Gaussian Elimination, and Interval Methods -- A Generalization of Shostak#x2019;s Method for Combining Decision Procedures -- Combining Relational Algebra, SQL, and Constraint Programming -- Computational Complexity of Propositional Linear Temporal Logics Based on Qualitative Spatial or Temporal Reasoning -- Exploiting Constraints for Domain Managing in CLP(FD) -- Tutorial: Reasoning with, about and for Constraint Handling Rules -- PROSPER An Investigation into Software Architecture for Embedded Proof Engines -- Constraint-Lambda Calculi -- Labelled Deduction over Algebras of Truth-Values* -- A Temporal × Modal Approach to the Definability of Properties of Functions.
520 _aThis volume contains the proceedings of FroCoS 2002, the 4th International Workshop on Frontiers of Combining Systems, held April 8-10, 2002 in Santa Margherita Ligure (near Genova), Italy. Like its predecessors, organized in - nich (1996), Amsterdam (1998), and Nancy (2000), FroCoS 2002 o?ered a c- mon forum for the presentation and discussion of research activities on the c- bination and integration of systems in various areas of computer science, such as logic, computation, program development and proof, arti?cial intelligence, mechanical veri?cation, and symbolic computation. There were 35 submissions of high quality, authored by researchers from countries including Australia, Belgium, Brazil, Finland, France, Germany, Italy, Portugal, Spain, Singapore, United Kingdom, United States of America, and - goslavia. All the submissions were thoroughly evaluated on the basis of at least three referee reports, and an electronic program committee meeting was held through the Internet. The program committee selected 14 research contributions. The topics covered by the selected papers include: combination of logics, c- bination of constraint solving techniques, combination of decision procedures, combination problems in veri?cation, modular properties of theorem proving, integration of decision procedures and other solving processes into constraint programming and deduction systems.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aArmando, Alessandro.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540433811
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2309
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-45988-X
942 _2EBK5654
_cEBK
999 _c34948
_d34948