Specification and integration of theorem provers and computer algebra systems
Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
A computational model of everything
Communications of the ACM
A new kind of science
Structures for Symbolic Mathematical Reasoning and Computation
DISCO '96 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems
Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems
A revisited perspective on symbolic mathematical computing and artificial intelligence
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Decision Making Modeled as a Theorem Proving Process
International Journal of Decision Support System Technology
Toward a trust model for knowledge-based communities
Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics
| Hi-index | 0.00 |
OMRS (Open Mechanized Reasoning Systems) was designed for Automated Theorem Proving and then extended to Computer Algebra. These are the two domains at the heart of the Calculemus approach. An obvious question is to assess whether such an approach can be extended to new domains either within AI or outside of AI. There have been several attempts to turn the world into a computational system. This talk stays away from such general attempts and introduces a framework that is fully set within AI. It extends the basic concepts of OMRS to diverse fields ranging from information technology to sociology through law as illustrated by examples. The main motivation is to claim that whatever the selected approach, Artificial Intelligence is gaining enough strength and power to reach new frontiers and to turn challenges that are not a priori of a purely computational nature into AI domains.