Cantitate/Preț
Produs

Artificial Intelligence, Automated Reasoning, and Symbolic Computation

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

Preț: 32544 lei

Preț vechi: 40680 lei
-20%

Puncte Express: 488

Carte tipărită la comandă

Livrare economică 16-30 septembrie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 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: 9783540438656
ISBN-10: 3540438653
Pagini: 364
Ilustrații: XIV, 350 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:2002
Editura: Springer
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.