Integrating Symbolic Mathematical Computation and Artificial Intelligence: Second International Conference, AISMC-2 Cambridge, United Kingdom, August 3–5, 1994 Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Johannes Ueberberg (auth.), Jacques Calmet, John A. Campbell (eds.)
Series: Lecture Notes in Computer Science 958
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1995

Language: English
Pages: 281
Tags: Symbolic and Algebraic Manipulation; Artificial Intelligence (incl. Robotics); Numerical Analysis; Combinatorics

Interactive theorem proving and computer algebra....Pages 1-9
A practical algorithm for geometric theorem proving....Pages 10-17
Combining theorem proving and symbolic mathematical computing....Pages 18-29
Tools for solving problems in the scope of algebraic programming....Pages 30-47
Planning a proof of the intermediate value theorem....Pages 48-63
A general technique for automatically optimizing programs through the use of proof plans....Pages 64-79
Datalog and TwoGroups and C++....Pages 80-92
Linear logic and real closed fields: A way to handle situations dynamically....Pages 93-114
A proof environment for arithmetic with the omega rule....Pages 115-130
Using commutativity properties for controlling coercions....Pages 131-143
Theories = signatures + propositions used as types....Pages 144-155
The ideal structure of Gröbner base computations....Pages 156-166
Modeling cooperating agents scenarios by deductive planning methods and logical fiberings....Pages 167-190
Propagation of mathematical constraints in subdefinite models....Pages 191-208
Combining computer algebra and rule based reasoning....Pages 209-223
Algebraic specification of empirical inductive learning methods based on rough sets and matroid theory....Pages 224-243
Subsymbolic processing using adaptive algorithms....Pages 244-254
An interpretation of the propositional Boolean algebra as a k-algebra. Effective calculus....Pages 255-263
Subdefinite computations and symbolic transformations in the uniCalc solver....Pages 264-275