9405 search results - page 1274 / 1881 » Computing a Model of Set Theory |
190
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
184
click to vote
ASP
2003
Springer
16 years 12 days ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
177
click to vote
LPNMR
1997
Springer
15 years 11 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
151
click to vote
APAL
2007
15 years 7 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
198
click to vote
IPL
2006
15 years 7 months ago
2006
In this paper, we present a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in 2D space using a distance metric induced by a regu...