Nicht aus der Schweiz? Besuchen Sie lehmanns.de

Integrating Symbolic Mathematical Computation and Artificial Intelligence

Second International Conference, AISMC-2, Cambridge, United Kingdom, August 3-5, 1994. Selected Papers
Buch | Softcover
XI, 281 Seiten
1995 | 1995
Springer Berlin (Verlag)
978-3-540-60156-2 (ISBN)

Lese- und Medienproben

Integrating Symbolic Mathematical Computation and Artificial Intelligence -
CHF 74,85 inkl. MwSt
This volume contains thoroughly revised full versions of the best papers presented at the Second International Conference on Artificial Intelligence and Sympolic Mathematical Computation, held in Cambridge, UK in August 1994.
The 19 papers included give clear evidence that now, after a quite long period when AI and mathematics appeared to have arranged an amicable separation, these fields are growing together again as an area of fruitful interdisciplinary activities. This book explores the interaction between mathematical computation and clears the ground for future concentration on topics that can further unify the field.

Interactive theorem proving and computer algebra.- A practical algorithm for geometric theorem proving.- Combining theorem proving and symbolic mathematical computing.- Tools for solving problems in the scope of algebraic programming.- Planning a proof of the intermediate value theorem.- A general technique for automatically optimizing programs through the use of proof plans.- Datalog and TwoGroups and C++.- Linear logic and real closed fields: A way to handle situations dynamically.- A proof environment for arithmetic with the omega rule.- Using commutativity properties for controlling coercions.- Theories = signatures + propositions used as types.- The ideal structure of Gröbner base computations.- Modeling cooperating agents scenarios by deductive planning methods and logical fiberings.- Propagation of mathematical constraints in subdefinite models.- Combining computer algebra and rule based reasoning.- Algebraic specification of empirical inductive learning methods based on rough sets and matroid theory.- Subsymbolic processing using adaptive algorithms.- An interpretation of the propositional Boolean algebra as a k-algebra. Effective calculus.- Subdefinite computations and symbolic transformations in the uniCalc solver.

Erscheint lt. Verlag 10.8.1995
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo XI, 281 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 233 mm
Gewicht 384 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Analysis
Mathematik / Informatik Mathematik Graphentheorie
Schlagworte Adaptive Algorithms • Adaptive Algortihmen • Artificial Intelligence • combinatorics • Computeralgebra • Computer Algebra • Intelligence • Künstliche Intelligenz • Regelbasiertes Schließen • Rule-Based Reasoning • Symbolic Computation • Symbolisches Rechnen • Theorembeweisen • theorem proving
ISBN-10 3-540-60156-2 / 3540601562
ISBN-13 978-3-540-60156-2 / 9783540601562
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95