Concepedia

Answerability Constraints

Answerability Constraints is a theoretical construct in riddle structure that specifies the necessary conditions under which a riddle’s solution can be logically and unambiguously determined from its textual clues, distinguishing it from general interpretive constraints by focusing exclusively on the solvability boundary between admissible and inadmissible answers.

2

Publications

31

Citations

7

Authors

4

Institutions

Publications per year

2017–2026

1

Parents

Publications

2

1–2 of 2

Authors

7

  1. HL
    Haejun Lee

    Samsung (South Korea), South Korea

    1 publications · 19 citations

    1

    h-index

  2. SC
    Sai Chetan Chinthakindi

    Samsung (South Korea), South Korea

    1 publications · 19 citations

    1

    h-index

  3. JC
    Jaegul Choo

    Korea Advanced Institute of Science and Technology, South Korea

    1 publications · 19 citations

    1

    h-index

  4. AK
    Akhil Kedia

    Samsung (South Korea), South Korea

    1 publications · 19 citations

    1

    h-index

  5. JS
    Jeff Swann

    University of North Carolina at Chapel Hill, United States

    1 publications · 12 citations

    1

    h-index

1–5 of 7

Institutions

4

  1. University of North Carolina at Chapel Hill

    Chapel Hill, United States

    1 h-index

    2 publications

    24 citations

  2. Korea University

    Seoul, South Korea

    1 h-index

    1 publications

    19 citations

  3. Samsung (South Korea)

    Seoul, South Korea

    1 h-index

    2 publications

    38 citations

  4. Indian Institute of Technology Bombay

    Mumbai, India

    1 h-index

    1 publications

    19 citations

1–4 of 4

Venues

  1. International Conference on Learning Representations

    Conference · 1 publications · 19 citations

    1

    h-index

  2. Education and Urban Society

    1 publications · 12 citations

    1

    h-index

1–2