Storytelling is seen as an effective tool to facilitate the transfer of knowledge. There are a number of story construction frameworks andits applications to construct knowledge stories in current literature but there the assessment of these applications and framework have not been emphasized. This paper presents the assessment of a story construction framework that is used as guide by construc...

ABSTRACT Speech recognition requires solving many space and time problems that can have a critical effect on the overall system performance. We describe the use of two general new algorithms [5] that transform recognition networks into equivalent ones that require much less time and space in large-vocabulary speech recognition. The new algorithms generalize classical automata determinization an...

We have been exploring the use of Web-derived knowledge bases through the development of Wikitology a hybrid knowledge base of structured and unstructured information extracted from Wikipedia augmented by RDF data from DBpedia and other Linked Open Data resources. In this paper, we describe approaches that aid in enriching Wikipedia and thus the resources that derive from Wikipedia such as the ...

The transport of L-sets along an L-relation R is considered, with L any residuated lattice, sometimes with further properties as to be a frame or an MV-algebra. Pairs of powerset operators related to R are considered and their basic properties are studied in a comprehensive discussion including some results already known. A few examples and suggestions for application and further development ar...

We study the construction of preorders on Set-monads by the semantic ⊤⊤-lifting. We show the universal property of this construction, and characterise the class of preorders on a monad as a limit of a Card-chain. We apply these theoretical results to identifying preorders on some concrete monads, including the powerset monad, maybe monad, and their composite monad. We also relate the constructi...

In this paper, we have established bi-approximation semantics for lattice-based logics with the De Morgan negation (unbounded orthologic), and their morphisms. In addition, we have discussed the dual representation between unbounded ortholattices with strict homomorphisms and polarity frames and d-morphisms. Apart from the abstract construction of dual algebras in the series of the present auth...

We introduce the notion of operational resolution, i.e., an isotone map from a powerset to a poset that meets two additional conditions, which generalizes the description of states as the atoms in a property lattice (Piron, 1976 and Aerts, 1982) or as the underlying set of a closure operator (Aerts, 1994 and Moore, 1995). We study the structure preservance of the related state transitions and s...

The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these results extend to the enriched setting, if we replace sets by posets or preorders. Preservation of weak pullbacks becomes preservation of exact lax squares....

We consider games where the winning conditions are disjunctions (or dually, conjunctions) of parity conditions; we call them generalized parity games. These winning conditions, while ω-regular, arise naturally when considering fair simulation between parity automata, secure equilibria for parity conditions, and determinization of Rabin automata. We show that these games retain the computational...