Theoretical Computer Science
Linear logic and lazy computation
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Generating plans in linear logic I: actions as proofs
Theoretical Computer Science
Generating plans in linear logic: II. A geometry of conjunctive actions
Theoretical Computer Science
Deciding provability of linear logic formulas
Proceedings of the workshop on Advances in linear logic
Efficient linear logic meaning assembly
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Scenario analysis based on linear logic
Proceedings of the 2005 ACM SIGCHI International Conference on Advances in computer entertainment technology
Plans, Actions and Dialogues Using Linear Logic
Journal of Logic, Language and Information
A3PAT, an approach for certified automated termination proofs
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Linear Logic for Non-Linear Storytelling
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Narratology for interactive storytelling: a critical introduction
TIDSE'06 Proceedings of the Third international conference on Technologies for Interactive Digital Storytelling and Entertainment
Hi-index | 0.00 |
This paper proposes a novel application of Interactive Proof Assistants for studying the formal properties of Narratives, building on recent work demonstrating the suitability of Intuitionistic Linear Logic as a conceptual model. More specifically, we describe a method for modelling narrative resources and actions, together with constraints on the story endings in the form of an ILL sequent. We describe how well-formed narratives can be interpreted from cut-free proof trees of the sequent obtained using Coq. We finally describe how to reason about narratives at the structural level using Coq: by allowing one to prove 2nd order properties on the set of all the proofs generated by a sequent, Coq assists the verification of structural narrative properties traversing all possible variants of a given plot.