Cantitate/Preț
Produs

Artificial Intelligence and Symbolic Computation: 8th International Conference, AISC 2006, Beijing, China, September 20-22, 2006, Proceedings: Lecture Notes in Computer Science, cartea 4120

Editat de Jaques Calmet, Tetsuo Ida, Dongming Wang
en Limba Engleză Paperback – 13 sep 2006

Din seria Lecture Notes in Computer Science

Preț: 32021 lei

Preț vechi: 40026 lei
-20% Nou

Puncte Express: 480

Preț estimativ în valută:
6128 6465$ 5107£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540397281
ISBN-10: 3540397280
Pagini: 288
Ilustrații: XIII, 269 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.43 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Presentations.- Interactive Mathematical Documents.- Algebra and Geometry.- An Inductive Inference System and Its Rationality.- Semantic Guidance for Saturation Provers.- Contributed Papers.- Labeled @-Calculus: Formalism for Time-Concerned Human Factors.- Enhanced Theorem Reuse by Partial Theory Inclusions.- Extension of First-Order Theories into Trees.- The Confluence Problem for Flat TRSs.- Some Properties of Triangular Sets and Improvement Upon Algorithm CharSer.- A New Definition for Passivity and Its Relation to Coherence.- A Full System of Invariants for Third-Order Linear Partial Differential Operators.- An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial.- Quantifier Elimination for Quartics.- On the Mixed Cayley-Sylvester Resultant Matrix.- Implicitization of Rational Curves.- Operator Calculus Approach to Solving Analytic Systems.- Solving Dynamic Geometric Constraints Involving Inequalities.- Constraints for Continuous Reachability in the Verification of Hybrid Systems.- Using Hajós’ Construction to Generate Hard Graph 3-Colorability Instances.- Finding Relations Among Linear Constraints.- A Search Engine for Mathematical Formulae.- Hierarchical Representations with Signatures for Large Expression Management.