Title

Using constraint logic programming to analyze the chronology in "A Rose for Emily''

Authors

Authors

J. Burg; A. Boyle;S. D. Lang

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Comput. Humanit.

Keywords

chronology; constraint logic programming; constraints; Faulkner; 'ROSE-FOR-EMILY'; CLP(R); Computer Science, Interdisciplinary Applications

Abstract

William Faulkner's non-chronological story telling style has long been a challenge to critics and a puzzle to beginning literature students. "A Rose for Emily,'' one of Faulkner's most frequently anthologized stories, exemplifies the complexity of Faulkner's treatment of time. In this paper, we apply a constraint-based problem solving method to an analysis of the chronology of "A Rose for Emily.'' Constraint logic programming is a declarative programming language paradigm that solves problems by enforcing constraints among variables. CLP's ability to sort numeric variables that do not yet have definite values makes it possible to sort the events of "A Rose for Emily'' with only fragmented and relative time information. In attempting to sort the events of the story, we find an inconsistency in the temporal references scattered throughout the narrative. After removing this inconsistency, we are able to compare our chronology with earlier ones and discuss the thematic relevance of Faulkner's nonlinear plots.

Journal Title

Computers and the Humanities

Volume

34

Issue/Number

4

Publication Date

1-1-2000

Document Type

Article

Language

English

First Page

377

Last Page

392

WOS Identifier

WOS:000165509000002

ISSN

0010-4817

Share

COinS