Table of contents (19 papers)

  1. Front Matter
  2. A practical algorithm for geometric theorem proving
    Ashutosh Rege, John Canny
    Pages 10-17
  3. Combining theorem proving and symbolic mathematical computing
    Karsten Homann, Jacques Calmet
    Pages 18-29
  4. Tools for solving problems in the scope of algebraic programming
    Y. V. Kapitonova, A. A. Letichevsky, M. S. L'vov, V. A. Volkov
    Pages 30-47
  5. Datalog and TwoGroups and C++
    Greg Butler
    Pages 80-92
  6. A proof environment for arithmetic with the omega rule
    Siani Baker, Alan Smaill
    Pages 115-130
  7. Using commutativity properties for controlling coercions
    Stephan A. Missura, Andreas Weber
    Pages 131-143
  8. Theories = signatures + propositions used as types
    Stephan A. Missura
    Pages 144-155
  9. The ideal structure of Gröbner base computations
    Stéphane Collart, Daniel Mall
    Pages 156-166
  10. Modeling cooperating agents scenarios by deductive planning methods and logical fiberings
    Jochen Pfalzgraf, Ute Cornelia Sigmund, Karel Stokkermans
    Pages 167-190
  11. Combining computer algebra and rule based reasoning
    Reinhard Bündgen
    Pages 209-223
  12. Subsymbolic processing using adaptive algorithms
    David J. Nettleton, Roberto Garigliano
    Pages 244-254
  13. An interpretation of the propositional Boolean algebra as a k-algebra. Effective calculus
    Luis M. Laita, Luis de Ledesma, Eugenio Roanes-Lozano, Eugenio Roanes-Macías
    Pages 255-263
  14. Subdefinite computations and symbolic transformations in the uniCalc solver
    Alexander Semenov, Alexander Babichev, Alexander Leshchenko
    Pages 264-275

About these proceedings

Introduction

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.

Keywords

Adaptive Algorithms Adaptive Algortihmen Computer Algebra Computeralgebra Regelbasiertes Schließen Rule-Based Reasoning Symbolic Computation Theorem Proving artificial intelligence intelligence

Bibliographic information

  • Copyright Information Springer-Verlag 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60156-2
  • Online ISBN 978-3-540-49533-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349