Sciweavers

654 search results - page 33 / 131
» Ordered Sets and Complete Lattices
Sort
View
CSCLP
2004
Springer
14 years 1 months ago
A Note on Bilattices and Open Constraint Programming
Abstract. We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orde...
Arnaud Lallouet
VL
2007
IEEE
157views Visual Languages» more  VL 2007»
14 years 1 months ago
Spider Diagrams of Order
Spider diagrams are a visual logic capable of makeing statements about relationships between sets and their cardinalities. Various meta-level results for spider diagrams have been...
Aidan Delaney, Gem Stapleton
IJCAI
1993
13 years 9 months ago
Second Order Measures for Uncertainty Processing
Uncertainty processing methods are analysed from the viewpoint of their sensitivity to small variations of certainty factors. The analysis makes use of the algebraic theory which ...
Zdenek Zdráhal
WAOA
2004
Springer
107views Algorithms» more  WAOA 2004»
14 years 29 days ago
Order-Preserving Transformations and Greedy-Like Algorithms
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
Spyros Angelopoulos
IFIP
2005
Springer
14 years 1 months ago
Relative Trustworthiness
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...
Johan W. Klüwer, Arild Waaler