Realization of a geometry-theorem proving machine
Computers & thought
Empirical explorations of the geometry-theorem proving machine
Computers & thought
Am: an artificial intelligence approach to discovery in mathematics as heuristic search.
Am: an artificial intelligence approach to discovery in mathematics as heuristic search.
Version spaces: an approach to concept learning.
Version spaces: an approach to concept learning.
A Semantically Guided Deductive System for Automatic Theorem Proving
IEEE Transactions on Computers
| Hi-index | 0.00 |
THIS paper describes a constraint transformation approach to automatic example generation and its implementation. In this approach examples are generated as the result of successive transformations of the constraint formulas Such transformations are carried out based on various forms of knowledge Systematic global simplification, largely based on declarative knowledge, mitigates the impact of applying problem-specific and efficient procedural knowledge, with a uniform problem representation scheme. The approach suggests a general framework for example generation in which a language for describing examples can be defined. It also combines a general formal reasoning capacity and problem-specific procedural knowledge, to achieve both generality and efficiency. The implemented system has proven to be expressively powerful and efficient for a variety of applications.