Within the last year
Within the past 3 years
1 - 10 of 11 articles
We discuss the problem of measuring the quality of decision support (classification) system that involves granularity based on rough set concepts. We put forward the proposal for such quality measure in the case when the underlying granular system is based on rough sets and makes use of...
In an earlier paper, the author adapted to Parsing Expression Grammars (PEGs) the properties FIRST and FOLLOW used in the construction of predictive top-down parsers. The purpose was to obtain warnings for possible “language hiding”. It turned out that FIRST does not work well with lookahead...
In the paper we discuss logical approaches to incomplete and/or nondeterministic data. As is well-known, complete and deterministic information systems induce indiscernibility relations and the lower and upper approximations regarded as operators obey the laws of S5 modal system. In the case of...
In this article we continue searching for functions which might be used as measures of inclusion of information granules in information granules. Starting with a 3-valued logic having an adequate logical matrix, we show how to derive a corresponding graded inclusion function. We report on the...
Between modal logic and closure operators for topological spaces as well as for formal languages there exists a strong relation. Modal logic allows to define classes of formal languages in several ways.
In the last years, the Java community has been arguing about adding closures to Java in order to improve expressivity. The debate has not yet terminated but all proposals seem to converge towards a notion of Simple Closures which contain only the essential features of anonymous functions. This...
In the paper we present a bounded model checking for 1-safe Petri nets and properties expressed in LTL and the universal fragment of CTL, based on binary decision diagrams. The presented experimental results show that we have obtained a technique which performs better in some of the considered...
Phenomena that inherently happen in distributed computing - some types of deadlock and fairness or starvation - are examined in a client-server model. Messages travelling between clients and a server are: request for an action, permission to start it, and termination of its execution....
A new formalism of Resource Driven Automata Nets (RDA-nets) is presented. A RDA-net has two levels: a system level is represented by a net of active resources, describing distribution of agents/resources and their interactions; agents in an object level are finite automata, communicating via...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.