|
|
|
|
LEADER |
03398nam a2200517 4500 |
001 |
978-3-540-46421-1 |
003 |
DE-He213 |
005 |
20191024193347.0 |
007 |
cr nn 008mamaa |
008 |
121227s2000 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540464211
|9 978-3-540-46421-1
|
024 |
7 |
|
|a 10.1007/10720084
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA8.9-10.3
|
072 |
|
7 |
|a PBC
|2 bicssc
|
072 |
|
7 |
|a MAT018000
|2 bisacsh
|
072 |
|
7 |
|a PBC
|2 thema
|
072 |
|
7 |
|a PBCD
|2 thema
|
082 |
0 |
4 |
|a 511.3
|2 23
|
245 |
1 |
0 |
|a Frontiers of Combining Systems
|h [electronic resource] :
|b Third International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings /
|c edited by Helene Kirchner, Christophe Ringeissen.
|
250 |
|
|
|a 1st ed. 2000.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2000.
|
300 |
|
|
|a X, 298 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 Artificial Intelligence ;
|v 1794
|
505 |
0 |
|
|a Invited Paper -- Combining Logic and Optimization in Cutting Plane Theory -- Session 1 -- Towards Cooperative Interval Narrowing -- Integrating Constraint Solving into Proof Planning -- Termination of Constraint Contextual Rewriting -- Invited Paper -- Axioms vs. Rewrite Rules: From Completeness to Cut Elimination -- Session 2 -- Normal Forms and Proofs in Combined Modal and Temporal Logics -- Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic -- Session 3 -- Handling Differential Equations with Constraints for Decision Support -- Non-trivial Symbolic Computations in Proof Planning -- Integrating Computer Algebra and Reasoning through the Type System of Aldor -- Invited Paper -- Combinations of Model Checking and Theorem Proving -- Session 4 -- Compiling Multi-paradigm Declarative Programs into Prolog -- Modular Redundancy for Theorem Proving -- Composing and Controlling Search in Reasoning Theories Using Mappings -- Invited Paper -- Why Combined Decision Problems Are Often Intractable -- Session 5 -- Congruence Closure Modulo Associativity and Commutativity -- Combining Equational Theories Sharing Non-Collapse-Free Constructors -- Comparing Expressiveness of Set Constructor Symbols.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
1 |
4 |
|a Mathematical Logic and Foundations.
|0 http://scigraph.springernature.com/things/product-market-codes/M24005
|
650 |
2 |
4 |
|a Artificial Intelligence.
|0 http://scigraph.springernature.com/things/product-market-codes/I21000
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|0 http://scigraph.springernature.com/things/product-market-codes/I16048
|
700 |
1 |
|
|a Kirchner, Helene.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Ringeissen, Christophe.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662172179
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540672814
|
830 |
|
0 |
|a Lecture Notes in Artificial Intelligence ;
|v 1794
|
856 |
4 |
0 |
|u https://doi.org/10.1007/10720084
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|