An Attempt to Automate <i>NP</i>-Hardness Reductions via <i>SO</i>∃ Logic
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 representation language for decision problems. Bui...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
University of Waterloo
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/1162 |