We present a framework for reformulating sentences by applying transfer rules on a typed dependency representation. We specify a list of operations that the framework needs to sup...
Generalization of the fundamental rough set discernibility tools aiming at searching for relevant patterns for complex decisions is discussed. As an example of application, there i...
Jan G. Bazan, Andrzej Skowron, Dominik Slezak, Jak...
In this paper a formal approach to construction of a similarity measure for complex creatures is presented. The simulation model is described, and a Framsticks agent is expressed i...
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
A wide-range of applications, including Publish/Subscribe, Workflow, and Web-site Personalization, require maintaining user’s interest in expected data as conditional expression...