Related papers: A Fixed-point Theorem for Horn Formula Equations
In this paper we present InterHorn, a solver for recursion-free Horn clauses. The main application domain of InterHorn lies in solving interpolation problems arising in software verification. We show how a range of interpolation problems,…
Programs that manipulate tree-shaped data structures often require complex, specialized proofs that are difficult to generalize and automate. This paper introduces a unified, foundational approach to verifying such programs. Central to our…
In this paper, we show the new fixed point theorem in metric spaces. Furthermore, for this fixed point theorem, we apply to the Collatz conjecture.
Hypothetical Datalog is based on an intuitionistic semantics rather than on a classical logic semantics, and embedded implications are allowed in rule bodies. While the usual implication (i.e., the neck of a Horn clause) stands for…
The classical Heron problem states: \emph{on a given straight line in the plane, find a point $C$ such that the sum of the distances from $C$ to the given points $A$ and $B$ is minimal}. This problem can be solved using standard geometry or…
We consider a relatively new hybrid generalized F-contraction involving a pair of mappings and utilize the same to prove a common fixed point theorem for a hybrid pair of occasionally coincidentally idempotent mappings satisfying…
In this paper we are going to prove a very general fixed point theorem for mappings acting in partial metric spaces. In that theorem we impose some conditions on behavior of considered mappings on orbits and a condition relating orbits of…
In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or…
The CLP scheme uses Horn clauses and SLD resolution to generate multiple constraint satisfaction problems (CSPs). The possible CSPs include rational trees (giving Prolog) and numerical algorithms for solving linear equations and linear…
In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…
In this paper we present a theory for the existence of multiple nontrivial solutions for a class of perturbed Hammerstein integral equations. Our methodology, rather than to work directly in cones, is to utilize the theory of fixed point…
The Ran-Reurings fixed point theorem [Proc. Amer. Math. Soc., 132 (2004), 1435-1443] is but a particular case of Maia's [Rend. Sem. Mat. Univ. Padova, 40 (1968), 139-143]. A "functional" version of this last result is then provided, in a…
The main contribution of the present paper is the introduction of a simple yet expressive hybrid-dynamic logic for describing quantum programs. This version of quantum logic can express quantum measurements and unitary evolutions of states…
We interpret a recent formula for counting orbits of $GL(d,F_q)$ in terms of counting fixed points as addition in the affine braided line. The theory of such braided groups (or Hopf algebras in braided categories) allows us to obtain the…
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
We describe fixed points of an infinite dimensional non-linear operator related to a hard core (HC) model with a countable set $\mathbb{N}$ of spin values on the Cayley tree. This operator is defined by a countable set of parameters…
The classical Brouwer fixed point theorem states that in R^d every continuous function from a convex, compact set on itself has a fixed point. For an arbitrary probability space, let L^0 = L^0 (\Omega, A,P) be the set of random variables.…
Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically…
The main aim of this paper is to study of fixed point theory in partial cone metric spaces. Infact, some common fixed point theorems for two mappings in partial cone metric spaces are obtained.
In this paper we extend the coupled fixed point theorems for mixed monotone operators $F:X \times X \rightarrow X$ obtained in [T.G. Bhaskar, V. Lakshmikantham, \textit{Fixed point theorems in partially ordered metric spaces and…