Using Constraint Logic Programming to Analyze theChronology in ``A Rose for Emily'''' |
| |
| Authors: | Jennifer Burg Anne Boyle Sheau-Dong Lang |
| |
| Affiliation: | (1) Department of Computer Science, Wake Forest University, Winston-Salem, NC 27109, USA;(2) Department of English, Wake Forest University, Winston-Salem, NC 27109, USA;(3) School of Computer Science, University of Central Florida, Orlando, Florida 32816, USA |
| |
| Abstract: | William Faulkner's non-chronological story tellingstyle has long been a challenge to critics and apuzzle to beginning literature students. ``A Rose forEmily,' one of Faulkner's most frequently anthologizedstories, exemplifies the complexity of Faulkner'streatment of time. In this paper, we apply aconstraint-based problem solving method to an analysisof the chronology of ``A Rose for Emily.' Constraintlogic programming is a declarative programminglanguage paradigm that solves problems by enforcingconstraints among variables. CLP's ability to sortnumeric variables that do not yet have definite valuesmakes it possible to sort the events of ``A Rose forEmily' with only fragmented and relative timeinformation. In attempting to sort the events of thestory, we find an inconsistency in the temporalreferences scattered throughout the narrative. Afterremoving this inconsistency, we are able to compareour chronology with earlier ones and discuss thethematic relevance of Faulkner's nonlinear plots. |
| |
| Keywords: | chronology constraint logic programming constraints Faulkner |
| 本文献已被 SpringerLink 等数据库收录！ |
|
