we first obtain some properties of a fundamentally nonexpansive self-mapping on a nonempty subset of a banach space and next show that if the banach space is having the opial condition, then the fixed points set of such a mapping with the convex range is nonempty. in particular, we establish that if the banach space is uniformly convex, and the range of such a mapping is bounded, closed and con...

In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier work where bounded model checking has been used for verification of sequential digital circuits. As the model of asynchronous systems a generalization of communicating automata, 1-safe Petri nets, are used. A mapping fr...

Private Set Intersection (PSI) and other private set operations have many current and emerging applications. Numerous PSI techniques have been proposed that vary widely in terms of underlying cryptographic primitives, security assumptions as well as complexity. One recent strand of PSI-related research focused on an additional privacy property of hiding participants’ input sizes. Despite some i...

Parameterized algorithms are a way to solve hard problems more efficiently, given that a specific parameter of the input is small. In this paper, we apply this idea to the field of answer set programming (ASP). To this end, we propose two kinds of graph representations of programs to exploit their treewidth as a parameter. Treewidth roughly measures to which extent the internal structure of a p...

In the present paper, we study some properties of fuzzy norm of linear operators. At first the bounded inverse theorem on fuzzy normed linear spaces is investigated. Then, we prove Hahn Banach theorem, uniform boundedness theorem and closed graph theorem on fuzzy normed linear spaces. Finally the set of all compact operators on these spaces is studied.

The concept of an $L$-bornology is introduced and the theory of $L$-bornological spacesis being developed. In particular the lattice of all $L$-bornologies on a given set is studied and basic properties ofthe category of $L$-bornological spaces and bounded mappings are investigated.

Stone algebras have been characterized by Chen and Grätzer in terms of triples (B;D;'), whereD is a distributive lattice with 1; B is a Boolean algebra, and ' is a bounded lattice homomorphism from B into the lattice of …lters of D: If D is bounded, the construction of these characterizing triples is much simpler, since the homomorphism ' can be replaced by one from B into D itself. The triple ...

In this paper, we present a novel approach to the evaluation of propositional answer-set programs. In particular, for programs with bounded treewidth, our algorithm is capable of (i) computing the number of answer sets in linear time and (ii) enumerating all answer sets with linear delay. Our algorithm relies on dynamic programming. Therefore, our approach significantly differs from standard AS...