Cantitate/Preț
Produs

Artificial Intelligence, Automated Reasoning, and Symbolic Computation: Joint International Conferences, AISC 2002 and Calculemus 2002 Marseille, France, July 1-5, 2002 Proceedings: Lecture Notes in Computer Science, cartea 2385

Editat de Jacques Calmet, Belaid Benhamou, Olga Caprotti, Laurent Henocque, Volker Sorge
en Limba Engleză Paperback – 19 iun 2002

Din seria Lecture Notes in Computer Science

Preț: 33569 lei

Preț vechi: 41961 lei
-20% Nou

Puncte Express: 504

Preț estimativ în valută:
6424 6698$ 5339£

Carte tipărită la comandă

Livrare economică 21 martie-04 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540438656
ISBN-10: 3540438653
Pagini: 364
Ilustrații: XIV, 350 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:2002
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 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 DomainSpecific 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.

Caracteristici

Includes supplementary material: sn.pub/extras