Browsing Mathematics (Faculty of) by Subject "theorem proving"
Now showing items 1-1 of 1
-
An Attempt to Automate <i>NP</i>-Hardness Reductions via <i>SO</i>∃ Logic
(University of Waterloo, 2004)We explore the possibility of automating <i>NP</i>-hardness reductions. We motivate the problem from an artificial intelligence perspective, then propose the use of second-order existential (<i>SO</i>∃) logic as ...