000 03375nam a22005775i 4500
001 978-3-540-46421-1
003 DE-He213
005 20240423132454.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 _a9783540464211
_9978-3-540-46421-1
024 7 _a10.1007/10720084
_2doi
050 4 _aQA8.9-10.3
072 7 _aPBCD
_2bicssc
072 7 _aPBC
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aPBCD
_2thema
072 7 _aPBC
_2thema
082 0 4 _a511.3
_223
245 1 0 _aFrontiers of Combining Systems
_h[electronic resource] :
_bThird International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings /
_cedited by Helene Kirchner, Christophe Ringeissen.
250 _a1st ed. 2000.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2000.
300 _aX, 298 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 Artificial Intelligence,
_x2945-9141 ;
_v1794
505 0 _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.
650 0 _aMathematical logic.
650 0 _aArtificial intelligence.
650 0 _aMachine theory.
650 1 4 _aMathematical Logic and Foundations.
650 2 4 _aArtificial Intelligence.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aKirchner, Helene.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRingeissen, Christophe.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540672814
776 0 8 _iPrinted edition:
_z9783662172179
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1794
856 4 0 _uhttps://doi.org/10.1007/10720084
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188134
_d188134