Uncomputable games : games for crowdsourcing formal reasoning

Authors
Govindarajulu, Naveen Sundar
ORCID
Loading...
Thumbnail Image
Other Contributors
Bringsjord, Selmer
Goldberg, Mark
Varela, Carlos A.
Bello, Paul
Cassimatis, Nicholas L. (Nicholas Louis), 1971-
Arkoudas, Konstantine
Issue Date
2013-08
Keywords
Computer science
Degree
PhD
Terms of Use
This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
Full Citation
Abstract
This work presents two games, the Catabot Rescue Game (CRG) and the Catabot Building Game (CBG), that capture theorem proving in first-order logic. The scope of the thesis is to invent and design the first games which both capture theorem proving in first- order logic and can also be played by players without having any knowledge of formal logic. The thesis successfully launches a project, "The Uncomputable Games Project," that seeks to use game playing by crowds for use in theorem proving. Many important science, engineering, and computational problems require at least first-order logic to be formalized. (Note: All computational problems can be cast in first-order logic.) Since first- order theorem proving is Turing-undecidable, no amount of algorithmic development or hardware improvement will ever be enough to help us realistically tackle all the problems we might be interested in. The games presented here could eventually help us harvest creative, general-purpose problem-solving at a massive scale. An abstract and simple for- malization of the proof construction workspace Slate is used as a background to show that the games capture first-order theorem proving. While implementing the full versions of the games and demonstrating new theorems being proved in first-order logic is beyond the scope of the thesis, initial data from early implementations for propositional logic is presented. While we do not have experiments for the full first-order case, some promise can be seen in that users untrained in logic were able to find proofs in propositional logic shorter than those found by an automated theorem prover.
Description
August 2013
School of Science
Department
Dept. of Computer Science
Publisher
Rensselaer Polytechnic Institute, Troy, NY
Relationships
Rensselaer Theses and Dissertations Online Collection
Access
Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.