  The Winograd Schema Challenge (WSC) is a natural language understanding task
proposed as an alternative to the Turing test in 2011. In this work we attempt
to solve WSC problems by reasoning with additional knowledge. By using an
approach built on top of graph-subgraph isomorphism encoded using Answer Set
Programming (ASP) we were able to handle 240 out of 291 WSC problems. The ASP
encoding allows us to add additional constraints in an elaboration tolerant
manner. In the process we present a graph based representation of WSC problems
as well as relevant commonsense knowledge. This paper is under consideration
for acceptance in TPLP.
