Author:
Matsuzaki Takuya,Fujita Tomohiro
Abstract
AbstractWe describe a system that detects an invariance in a logical formula expressing a math problem and simplifies it by eliminating variables utilizing the invariance. Pre-defined function and predicate symbols in the problem representation language are associated with algebraically indexed types, which signify their invariance property. A Hindley-Milner style type reconstruction algorithm is derived for detecting the invariance of a problem. In the experiment, the invariance-based formula simplification significantly enhanced the performance of a problem solver based on quantifier-elimination for real-closed fields, especially on the problems taken from the International Mathematical Olympiads.
Publisher
Springer International Publishing
Reference21 articles.
1. Aloul, F.A., Sakallah, K.A., Markov, I.L.: Efficient symmetry breaking for boolean satisfiability. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, IJCAI 2003, pp. 271–276 (2003)
2. Arai, N.H.: Tractability of cut-free Gentzen type propositional calculus with permutation inference. Theoret. Comput. Sci. 170(1), 129–144 (1996)
3. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);NH Arai,2000
4. Atkey, R., Johann, P., Kennedy, A.: Abstraction and invariance for algebraically indexed types. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, pp. 87–100 (2013)
5. Brown, C.W., Davenport, J.H.: The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, ISSAC 2007, pp. 54–60 (2007)