Artificial Intelligence and Symbolic Mathematical Computation
Editat de Jaques Calmet, John A. Campbell, Jochen Pfalzgrafen Limba Engleză Paperback – 11 sep 1996
The 19 revised full papers presented in the book were carefully selected by the program committee; also included are four invited survey and state-of-the-art contributions by Scott, Dillmann and Friedrich, Cohn, and Wang. Among the topics addressed are theorem proving, rewriting systems, symbolic computation, spatial reasoning, computational geometry, and automated deduction.
Preț: 327.07 lei
Preț vechi: 408.84 lei
-20%
Puncte Express: 491
Carte tipărită la comandă
Livrare economică 13-27 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540617327
ISBN-10: 3540617329
Pagini: 396
Ilustrații: VIII, 384 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:1996
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540617329
Pagini: 396
Ilustrații: VIII, 384 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:1996
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Symbolic computation and teaching.- Analytica — An experiment in combining theorem proving and symbolic computation.- Document recognition, semantics, and symbolic reasoning in reverse engineering of software.- Compromised updates in labelled databases.- An inference engine for propositional two-valued logic based on the radical membership problem.- Programming by demonstration: A machine learning approach to support skill acquision for robots.- Knowledge-based information processing in manufacturing cells — The present and the future.- Calculi for qualitative spatial reasoning.- Combining local consistency, symbolic rewriting and interval methods.- Proof transformation for non-compatible rewriting.- PATCH Graphs: An efficient data structure for completion of finitely presented groups.- Measuring the likely effectiveness of strategies.- A new approach on solving 3-satisfiability.- Geometry machines: From AI to SMC.- Interactive Theorem Proving and finite projective planes.- Towards modelling the topology of homogeneous manifolds by means of symbolic computation.- Solving geometrical constraint systems using CLP based on linear constraint solver.- Towards a sheaf semantics for cooperating agents scenarios.- Data types in subdefinite models.- On theorem-proving in Horn theories with built-in algebras.- Backward reasoning in systems with cut.- Soundness and completeness versus lifting property.- Reasoning with preorders and dynamic sorts using free variable tableaux.