000 06575cam a22008654a 4500
001 ocm50425723
003 OCoLC
005 20250703142828.0
006 m o d
007 cr |n|||||||||
008 020605s2002 gw a ob 101 0 eng c
040 _aCOO
_beng
_epn
_cCOO
_dHNK
_dBAKER
_dWAU
_dOCLCQ
_dYNG
_dOHI
_dCSU
_dNOC
_dDKDLA
_dOCLCA
_dOCLCQ
_dGW5XE
_dOCLCA
_dOCLCF
_dOCLCQ
_dOCLCO
_dOCLCQ
_dOCL
_dOCLCO
_dOCLCQ
_dEBLCP
_dYDX
_dSHS
_dUAB
_dESU
_dOCLCQ
_dBUF
_dQE2
_dOCLCA
_dOCLCQ
_dEUX
_dOCLCQ
_dUKAHL
_dOCLCO
_dOCLCQ
_dWSU
_dOCLCO
015 _aGBA249249
_2bnb
016 7 _a009729131
_2Uk
019 _a436650057
_a644324583
_a768064047
_a1053977438
_a1114575680
_a1238451169
020 _a9783540454700
_q(electronic bk.)
020 _a3540454705
_q(electronic bk.)
020 _z3540438653
_q(acid-free paper)
020 _z9783540438656
_q(acid-free paper)
024 7 _a10.1007/3-540-45470-5
_2doi
029 1 _aAU@
_b000044635191
029 1 _aAU@
_b000051315882
029 1 _aAU@
_b000051691289
029 1 _aAU@
_b000065091783
029 1 _aNZ1
_b14994308
029 1 _aNZ1
_b15295908
029 1 _aAU@
_b000078468578
035 _a(OCoLC)50425723
_z(OCoLC)436650057
_z(OCoLC)644324583
_z(OCoLC)768064047
_z(OCoLC)1053977438
_z(OCoLC)1114575680
_z(OCoLC)1238451169
042 _apcc
050 4 _aQ334
_b.A768 2002
055 3 _aQA75
_b.L38 no.2385
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aQA
_2lcco
082 0 4 _a006.3
_221
049 _aMAIN
111 2 _aAISC (Conference)
_n(6th :
_d2002 :
_cMarseille, France)
_916409
245 1 0 _aArtificial intelligence, automated reasoning, and symbolic computation :
_bjoint international conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002 : proceedings /
_cJacques Calmet [and others] (eds.).
260 _aBerlin ;
_aNew York :
_bSpringer,
_c©2002.
300 _a1 online resource (xi, 341 pages) :
_billustrations
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
347 _bPDF
490 1 _aLecture notes in computer science,
_x0302-9743 ;
_v2385.
_aLecture notes in artificial intelligence.
504 _aIncludes bibliographical references and index.
520 _aThis book constitutes the refereed proceedings of the joint International Conferences on Artificial Intelligence and Symbolic Computation, AISC 2002, and Calculemus 2002 held in Marseille, France, in July 2002. The 24 revised full papers presented together with 2 system descriptions were carefully reviewed and selected from 52 submissions. Among the topics covered are automated theorem proving, logical reasoning, mathematical modeling, algebraic computations, computational mathematics, and applications in engineering and industrial practice.
505 0 _aInvited Talks -- Constraint Acquisition -- Expressiveness and Complexity of Full First-Order Constraints in the Algebra of Trees -- Deduction versus Computation: The Case of Induction -- Integration of Quantifier Elimination with Constraint Logic Programming -- AISC Regular Talks -- Towards a Hybrid Symbolic/Numeric Computational Approach in Controller Design -- Inductive Synthesis of Functional Programs -- A Symbolic Computation-Based Expert System for Alzheimer's Disease Diagnosis -- On a Generalised Logicality Theorem -- Using Symbolic Computation in an Automated Sequent Derivation System for Multi-valued Logic -- The Wright? Function -- Multicontext Logic for Semigroups of Contexts -- Indefinite Integration as a Testbed for Developments in Multi-agent Systems -- Expression Inference -- Genetic Symbolic Classification Integrated with Non-linear Coefficient Optimisation -- A Novel Face Recognition Method -- Non-commutative Logic for Hand-Written Character Modeling -- From Numerical to Symbolic Data during the Recognition of Scenarii -- On Mathematical Modeling of Networks and Implementation Aspects -- Continuous First-Order Constraint Satisfaction -- Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints -- A Genetic-Based Approach for Satisfiability Problems -- On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope -- Calculemus Regular Talks -- Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements -- The Meaning of Infinity in Calculus and Computer Algebra Systems -- Making Conjectures about Maple Functions -- Employing Theory Formation to Guide Proof Planning -- Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms -- Combining Generic and Domain Specific Reasoning by Using Contexts -- Inductive Theorem Proving and Computer Algebra in the MathWeb Software Bus -- Yacas: A Do-It-Yourself Symbolic Algebra Environment -- Focus Windows: A New Technique for Proof Presentation.
650 0 _aArtificial intelligence
_vCongresses.
650 0 _aLogic, Symbolic and mathematical
_vCongresses.
650 0 _aAutomatic theorem proving
_vCongresses.
_914919
650 6 _aIntelligence artificielle
_vCongrès.
_917678
650 6 _aLogique symbolique et mathématique
_vCongrès.
650 6 _aThéorèmes
_xDémonstration automatique
_vCongrès.
_914921
650 7 _aArtificial intelligence
_2fast
_91340
650 7 _aAutomatic theorem proving
_2fast
_914923
650 7 _aLogic, Symbolic and mathematical
_2fast
_91341
655 7 _aproceedings (reports)
_2aat
655 7 _aConference papers and proceedings
_2fast
_96065
655 7 _aConference papers and proceedings.
_2lcgft
_96065
655 7 _aActes de congrès.
_2rvmgf
_9609890
700 1 _aCalmet, Jacques.
_916412
711 2 _aCalculemus 2000
_d(2002 :
_cMarseille, France)
_916413
776 0 8 _iPrint version:AISC 2002 (2002 : Marseille, France)
_tArtificial intelligence, automated reasoning, and symbolic computation : joint international conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002 : proceedings
_w(OCoLC)49991602
830 0 _aLecture notes in computer science ;
_v2385.
830 0 _aLecture notes in computer science.
_pLecture notes in artificial intelligence.
_914916
856 4 0 _uhttps://link.springer.com/10.1007/3-540-45470-5
938 _aAskews and Holts Library Services
_bASKH
_nAH20755280
938 _aBaker & Taylor
_bBKTY
_c69.95
_d69.95
_i3540438653
_n0004021677
_sactive
938 _aProQuest Ebook Central
_bEBLB
_nEBL3071863
938 _aYBP Library Services
_bYANK
_n13350908
994 _a92
_bATIST
999 _c635435
_d635435