We discuss two major fixed point theorems which are based on a notion of completeness. Although the spaces involved are of different nature, there is a similarity between the two theorems.

After the success of stable model semantics [GL88] and its generalization for programs with classical negations [GL90], the same ideas have been used in [GL91] to include disjunction into theâ€¦ (More)

In this work, we define signed disjunctive programs and investigate the existence of answer sets for this class of programs. Our main argument is based on an analogue to Tarski-fixed point theoremâ€¦ (More)

The purpose of this paper is to present a new characterization of the set of all intervals. This characterization is based on several natural properties useful in mathematical modeling; the main ofâ€¦ (More)

Measurements are always imprecise and therefore, in real life, we never know the exact values x1, ..., xv of physical quantities. No matter how many measurements we make, and how many statementsâ€¦ (More)

2013 8th International Conference on Intelligentâ€¦

2013

The existence of real distributed satisfaction problems motivates researchers to focus on DisCSPs works. But few works that consider the real aspect of these problems, whether iii the modeling phaseâ€¦ (More)

This paper is inspired by the work of Sine and Soardi [9], [10]. We introduce the notion of hyperconvexity in generalized ultrametric spaces i.e. where the distance has values in an arbitraryâ€¦ (More)