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

A knowledge hunting framework for common sense reasoning

Emami, A · 1958

Earlier work this paper cites.

The stable model semantics for logic programming

Gelfond, M · 1988

Earlier work this paper cites.

Wordnet: a lexical database for english

Miller, G. A · 1995

Earlier work this paper cites.

Knowledge representation, reasoning and declarative problem solving

Baral, C · 2003

Earlier work this paper cites.

A (sub) graph isomorphism algorithm for matching large graphs

Cordella, L. P · 2004

Earlier work this paper cites.

Assat: Computing answer sets of a logic program by sat solvers

Lin, F · 2004

Cited alongside, same era.

The winograd schema challenge

Levesque, H. J · 2011

Cited alongside, same era.

Abstract meaning representation for sembanking

Banarescu, L · 2013

Cited alongside, same era.

Tackling winograd schemas by formalizing relevance theory in knowledge graphs

Schüller, P · 2014

Cited alongside, same era.

The winograd schema challenge and reasoning about correlation

Bailey, D · 2015

Cited alongside, same era.

Identifying various kinds of event mentions in k-parser output

Sharma, A

Cited in the paper.

Towards addressing the winograd schema challenge-building and using a semantic parser and a knowledge hunting module

Sharma, A

Cited in the paper.

Tackling the winograd schema challenge through machine logical inferences

Isaak, N · 2016

Later among the works it cites.

Cause-effect knowledge acquisition and neural association model for solving a set of winograd schema problems

Liu, Q · 2017

Later among the works it cites.

The role of pragmatics in solving the winograd schema challenge

Richard-Bollans, A · 2017

Later among the works it cites.

Interpreting winograd schemas via the sp theory of intelligence and its realisation in the sp computer model

Original

Wolff, J. G · 2018

Later among the works it cites.

Language models are unsupervised multitask learners

Radford, A · 2019

Closest in time.