Are these two problems (1 and 2) partially equivalent in their description?

1)-HALT_TM= {

| P is a TM and P halts on input }. Show that -HALT_TMis undecidable

2)A_TM= { | M is a TM that accepts }. Show that A_TMis undecidable.

The only difference between these two that I could see is that (2) does not cover the situation when it rejects and halts (i.e. it covers the accepts and halts) whereas (1) covers the both i.e. accepts & halts AND rejects & halts.

What could be a solution for (1)? Do we have to resolve it by Turing reduction or mapping reduction? Do we have to resolve it by reducing

A_TMor HALT_TM

to -HALT_TM

Or there is some other possible way ? Please outline.