The purpose of this work is to investigate the existence of fixed points of some mappings in fixed point theory by combining some important concepts which are F-weak contractions, multivalued mappings, integral transformations and α-admissible mappings. In fixed point theory, it is important to find fixed points of some classess under F- or F-weak contractions. Also multivalued mappings is the ...

Reiter’s default logic formalizes nonmonotonic reasoning using default assumptions. The semantics of a given instance of default logic is based on a fixpoint equation defining an extension. Three different reasoning problems arise in the context of default logic, namely the existence of an extension, the presence of a given formula in an extension, and the occurrence of a formula in all extensi...

this paper presents some results concerning the existence of solutions for a functional integral equation of volterra type in two variables, via measure of noncompactness. two examples are included to illustrate the main result.

in this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regularasymptotically nonexpansive mappings in a real reflexive banach space with a uniformly g$hat{a}$teaux differentiable norm. our result is applicable in $l_{p}(ell_{p})$ spaces,$1 < p

begin{abstract} in this paper, we introduce an iterative method for amenable semigroup of non expansive mappings and infinite family of non expansive mappings in the frame work of hilbert spaces. we prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. the results present...

In this paper, we address the problem of defining a fixpoint semantics for Constraint Handling Rules (CHR) that captures the behavior of both simplification and propagation rules in a sound and complete way with respect to their declarative semantics. Firstly, we show that the logical reading of states with respect to a set of simplification rules can be characterized by a least fixpoint over t...