# Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge

## TL;DR

This paper presents a novel approach using Answer Set Programming to incorporate commonsense knowledge for solving the Winograd Schema Challenge, successfully addressing a significant portion of the problems.

## Contribution

It introduces a graph-based representation and ASP encoding for WSC, enabling reasoning with additional constraints and handling 240 out of 291 problems.

## Key findings

- Solved 240 out of 291 WSC problems
- Developed a graph-based representation of WSC
- Encoded reasoning with ASP for commonsense knowledge

## Abstract

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.