An Attempt to Automate NP-Hardness Reductions via SO ∃ Logic

@inproceedings{Nijjar2004AnAT,
  title={An Attempt to Automate NP-Hardness Reductions via SO ∃ Logic},
  author={Paul Nijjar},
  year={2004}
}
We explore the possibility of automating NP-hardness reductions. We motivate the problem from an artificial intelligence perspective, then propose the use of second-order existential (SO∃) logic as representation language for decision problems. Building upon the theoretical framework of J. Antonio Medina, we explore the possibility of implementing seven… CONTINUE READING