A fully automatic problem solver with human-style output

09/17/2013
by   M. Ganesalingam, et al.
0

This paper describes a program that solves elementary mathematical problems, mostly in metric space theory, and presents solutions that are hard to distinguish from solutions that might be written by human mathematicians. The program is part of a more general project, which we also discuss.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2018

NAPS: Natural Program Synthesis Dataset

We present a program synthesis-oriented dataset consisting of human writ...
research
03/31/2016

Building the Signature of Set Theory Using the MathSem Program

Knowledge representation is a popular research field in IT. As mathemati...
research
01/08/2013

Planning and Scheduling in Hybrid Domains Using Answer Set Programming

In this paper we present an Action Language-Answer Set Programming based...
research
08/09/2013

MaLeS: A Framework for Automatic Tuning of Automated Theorem Provers

MaLeS is an automatic tuning framework for automated theorem provers. It...
research
12/28/2010

On Elementary Loops of Logic Programs

Using the notion of an elementary loop, Gebser and Schaub refined the th...
research
02/08/2016

The "Sprekend Nederland" project and its application to accent location

This paper describes the data collection effort that is part of the proj...
research
05/24/2023

On Program Completion, with an Application to the Sum and Product Puzzle

This paper describes a generalization of Clark's completion that is appl...

Please sign up or login with your details

Forgot password? Click here to reset