In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on universe. In the view of granular computing, classical ro...
— In a wide range of applications the orientation of a rigid body does not need to be restricted to one given orientation, but can be given as a continuous set of frames. We addr...
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...