685 search results - page 4 / 137 » Closure Operators for Order Structures |
ESA
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We describe a data structure for three-dimensional Nef complexes, algorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef ...
RSCTC
1998
Springer
14 years 2 months ago
1998
Springer
This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and pos...
TARK
2005
Springer
14 years 3 months ago
2005
Springer
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning incons...
ENTCS
2006
13 years 9 months ago
2006
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
LICS
1998
IEEE
14 years 1 months ago
1998
IEEE
In this paper we describe the promoted tyft tyxt rule format for de ning higher-order languages. The rule format is a generalization of Groote and Vaandrager's tyft tyxt form...