Integrating symbolic mathematical computation and artificial intelligence : Second International Conference, AISMC-2, Cambridge, United Kingdom, August 3-5, 1994 : selected papers
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 pe...
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
958 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Integrating symbolic mathematical computation and artificial intelligence, Second International Conference, AISMC-2, Cambridge, United Kingdom, August 3-5, 1994, selected papers, Jacques Calmet, John A. Campbell, eds, Berlin, Springer-Verlag, 1995, 1 vol. (X-275 p.), Lecture notes in computer science, 3-540-60156-2 • Integrating Symbolic Mathematical Computation and Artificial Intelligence, Texte imprimé, 9783662195956 |
Table des matières:
- 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.