Difference between revisions of "Aesop's Fables"

From IDSwiki
Jump to: navigation, search
Line 23: Line 23:
  
 
===Réferences===
 
===Réferences===
 +
Szilas, N., & Richle, U. (2013). [http://drops.dagstuhl.de/opus/volltexte/2013/4164/pdf/p257-szilas.pdf Towards a Computational Model of Dramatic Tension]. In M. A. Finlayson, B. Fisseni, B. Löwe, & J. C. Meister (Eds.), 2013 Workshop on Computational Models of Narrative (Vol. 32, pp. 257–276). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
  
 
</div>
 
</div>

Revision as of 23:09, 25 September 2015

Structural Analysis of the Aesop's Fables


Objectives

This wiki aims at analyzing Aesop's Fable in order to refine a structural model of narrative for interactive storytelling.


Content

The 20 first Aesop's Fables (V.S. Vernon Jones English translation) have been analyzed.

Each fable is analyzed as a graph of interconnected nodes. The list of node types and relation types in the theoretical model are documented here.

Dramatic cycles are subparts of a graph that represent paradoxes, according to Bill Nichols approach. These cycles correspond to "conflicts". A dramatic cycle is coded as a pair of two paths, the positive path and the negative path.

Réferences

Szilas, N., & Richle, U. (2013). Towards a Computational Model of Dramatic Tension. In M. A. Finlayson, B. Fisseni, B. Löwe, & J. C. Meister (Eds.), 2013 Workshop on Computational Models of Narrative (Vol. 32, pp. 257–276). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.