|
|
|
|
| LEADER |
03528nam a22005535i 4500 |
| 001 |
978-3-540-31730-2 |
| 003 |
DE-He213 |
| 005 |
20151204171153.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100316s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540317302
|9 978-3-540-31730-2
|
| 024 |
7 |
|
|a 10.1007/11559306
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UY
|2 bicssc
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 072 |
|
7 |
|a COM031000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Frontiers of Combining Systems
|h [electronic resource] :
|b 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005. Proceedings /
|c edited by Bernhard Gramlich.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
| 300 |
|
|
|a X, 321 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3717
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 700 |
1 |
|
|a Gramlich, Bernhard.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540290513
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3717
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11559306
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
