LEADER 03670nam  22006015  450 
001 996466124503316
005 20200702155744.0
010   $a3-540-46421-2
024 7 $a10.1007/10720084
035   $a(CKB)1000000000548827
035   $a(SSID)ssj0000323326
035   $a(PQKBManifestationID)11277796
035   $a(PQKBTitleCode)TC0000323326
035   $a(PQKBWorkID)10296650
035   $a(PQKB)10814380
035   $a(DE-He213)978-3-540-46421-1
035   $a(MiAaPQ)EBC3087948
035   $a(PPN)155165615
035   $a(EXLCZ)991000000000548827
100   $a20121227d2000      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aFrontiers of Combining Systems$b[electronic resource] $eThird International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings /$fedited by Helene Kirchner, Christophe Ringeissen
205   $a1st ed. 2000.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000.
215   $a1 online resource (X, 298 p.) 
225 1 $aLecture Notes in Artificial Intelligence ;$v1794
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-67281-8 
320   $aIncludes bibliographical references at the end of each chapters and index.
327   $aInvited 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.
410  0$aLecture Notes in Artificial Intelligence ;$v1794
606   $aMathematical logic
606   $aArtificial intelligence
606   $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005
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
615  0$aMathematical logic.
615  0$aArtificial intelligence.
615 14$aMathematical Logic and Foundations.
615 24$aArtificial Intelligence.
615 24$aMathematical Logic and Formal Languages.
676   $a511.3
702   $aKirchner$b Helene$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRingeissen$b Christophe$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aFroCoS 2000
906   $aBOOK
912   $a996466124503316
996   $aFrontiers of Combining Systems$9772665
997   $aUNISA