Computational narrative is a complex and interesting domain for exploring AI techniques that algorithmically analyze, understand, and most importantly, generate stories. This paper studies the importance of domain knowledge in story generation, and particularly in analogy-based story generation (ASG). Based on the construct of knowledge container in case-based reasoning, we present a theoretica...

Event-based summarization extracts and organizes summary sentences in terms of the events that the sentences describe. In this work, we focus on semantic relations among event terms. By connecting terms with relations, we build up event term graph, upon which relevant terms are grouped into clusters. We assume that each cluster represents a topic of documents. Then two summarization strategies ...

Interpretation is a theory developed to reason about the abstraction relation between two different semantics. The theory requires the two semantics to be defined on domains which are complete lattices. (C, ) (concrete domain) is the domain of the concrete semantics, while (A,≤) (abstract domain) is the domain of the abstract semantics. The partial order relations reflect an approximation relat...

We develop a semantic theory based on testing for a minor variant of the-calculus. The resulting semantic equivalence can be characterised using of acceptance sets and can also be characterised as an equational theory. We deene a class of interpretations for the-calculus and construct one which is fully-abstract. Moreover the interpretation we construct is initial in the class of all fully-abst...

How individual are visual preferences? For real-world scenes, there is high agreement in observer's preference ratings. This could be driven by visual attributes of the images but also by non-visual associations, since those are common to most individuals. To investigate this, we developed a set of novel abstract, visually diverse images. At the individual observer level both abstract and real-...

The abstract interpretation is a general method to compute automatically program invariants. This method leads to solve a non-linear fixed point equation involving a monotone function. Determining numerical invariants in order, for instance, to give bounds on the values taken by the variables of a program, turns out to be equivalent to solving a two-player zero-sum game with stopping options. T...

In this paper, we propose a new semantic clone detection technique by comparing programs’ abstract memory states, which are computed by a semantic-based static analyzer. Our experimental study using three large-scale open source projects shows that our technique can detect semantic clones that existing syntacticor semantic-based clone detectors miss. Our technique can help developers identify i...

Noun/verb dissociations in the literature defy interpretation due to the confound between lexical category and semantic meaning; nouns and verbs typically describe concrete objects and actions. Abstract words, pertaining to neither, are a critical test case: dissociations along lexical-grammatical lines would support models purporting lexical category as the principle governing brain organisati...

We deal with a wide range of colors in our daily life. They are such ubiquitous phenomena that is hard and next to impossible to imagine even a single entity (be it an object, place, living creature, etc) devoid of them. They are like death and tax which nobody can dispense with. This omnipresence of colors around us has also made its way through abstract and less tangible entities via the inte...

We present the creation of an English-Swedish FrameNet-based grammar in Grammatical Framework. The aim of this research is to make existing framenets computationally accessible for multilingual natural language applications via a common semantic grammar API, and to facilitate the porting of such grammar to other languages. In this paper, we describe the abstract syntax of the semantic grammar w...