A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic co...
This paper intends to classify, review, and compare the existing languages for the specification of spatial integrity constraints at the conceptual level. We classify these languag...
This paper presents the language and software environment LEADSTO that has been developed to model and simulate the dynamics of Multi-Agent Systems (MAS) in terms of both qualitati...
Tibor Bosse, Catholijn M. Jonker, Lourens van der ...
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give â...
Our goal is to understand human language use and create systems that can use human language fluently. We argue that to a achieve this goal, we must formulate all of the problems fo...
Nicholas L. Cassimatis, Arthi Murugesan, Magdalena...