In this paper, we present an algorithm for computing the least solution of a system of monotone equations. This algorithm can be viewed as an effective form of the following well-known fixed point theorem: Theorem Let V be a finite set of variables. Let (P,≤,⊥) be a partially ordered se
This paper continues investigations of the monotone fixed point principle in the context of Feferman...
AbstractAfter a simple and convenient generalization of the notion of continuous functions and conti...
summary:The paper deals with the properties of a monotone operator defined on a subset of an ordered...
We present a practical algorithm for computing least solutions of systems of (fixpoint-)equations ov...
We present a very simple, yet general algorithm for computing simultaneous, minimum fixed-points of...
. We present a new algorithm which computes a partial approximate solution for a system of equations...
This paper presents a method for computing a least fixpoint of a system of equations over booleans. ...
. We present a new fixpoint theorem which guarantees the existence and the finite computability of t...
The context for this paper is Feferman's theory of explicit mathematics, a formal framework ser...
Least fixpoints of monotone functions are an important concept in computer science which can be gene...
This paper continues investigations of the monotone fixed point principle in the context of Feferman...
Abstract. We consider the problem of computing the least solution Xi, i = 1,..., n, of a system of e...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
It is a consequence of existing literature that least and greatest fixed-points of monotone polynomi...
Abstract. We consider the problem of enumerating all minimal integer solutions of a monotone system ...
This paper continues investigations of the monotone fixed point principle in the context of Feferman...
AbstractAfter a simple and convenient generalization of the notion of continuous functions and conti...
summary:The paper deals with the properties of a monotone operator defined on a subset of an ordered...
We present a practical algorithm for computing least solutions of systems of (fixpoint-)equations ov...
We present a very simple, yet general algorithm for computing simultaneous, minimum fixed-points of...
. We present a new algorithm which computes a partial approximate solution for a system of equations...
This paper presents a method for computing a least fixpoint of a system of equations over booleans. ...
. We present a new fixpoint theorem which guarantees the existence and the finite computability of t...
The context for this paper is Feferman's theory of explicit mathematics, a formal framework ser...
Least fixpoints of monotone functions are an important concept in computer science which can be gene...
This paper continues investigations of the monotone fixed point principle in the context of Feferman...
Abstract. We consider the problem of computing the least solution Xi, i = 1,..., n, of a system of e...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
It is a consequence of existing literature that least and greatest fixed-points of monotone polynomi...
Abstract. We consider the problem of enumerating all minimal integer solutions of a monotone system ...
This paper continues investigations of the monotone fixed point principle in the context of Feferman...
AbstractAfter a simple and convenient generalization of the notion of continuous functions and conti...
summary:The paper deals with the properties of a monotone operator defined on a subset of an ordered...
.png%3Fwidth%3D300&w=3840&q=75)
Add to ORKG