Results 301 to 310 of about 709,341 (346)
Some of the next articles are maybe not open access.
Arguing with Valued Preference Relations
2011Dung's argumentation is based on a Boolean binary defeat relation. Recently, this framework has been extended in order to consider the strength of the defeat relation, i.e., to quantify the degree to which an argument defeats another one. In the extended framework, the defeat relation with varied strength is abstract, i.e., its origin is not known.
Souhila Kaci, Christophe Labreuche
openaire +1 more source
Heuristic minimization of multiple-valued relations
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993An approach to minimization that is based on a state-of-the-art paradigm for the two-level minimization of functions is presented. Some special properties of relations, in contrast to functions, which must be carefully considered in realizing a high-quality procedure for solving the minimization problem are clarified.
Yosinori Watanabe, Robert K. Brayton
openaire +1 more source
Relating information and value disciplines
Information Management & Computer Security, 1996Shows, giving examples, how information technology is changing business practices. Investigates the benefits of information systems which are brought about by structural changes to processes and organizations. Identifies three value disciplines on which market leaders concentrate ‐ operational excellence, customer intimacy and product leadership ...
openaire +1 more source
To Be and Not To Be: 3-Valued Relations on Graphs
2009Spatial information requires models which allow us to answer 'maybe' to questions asking whether a location lies within a region. At the same time, models must account for data at varying levels of detail. Existing theories of fuzzy relations and fuzzy graphs do not support notions of granularity that generalize the successes of rough set theory to ...
openaire +1 more source
On Many-Valued Partitions and Many-Valued Equivalence Relations
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2003For a fixed integral commutative cl-monoid M=(L, ≤, *), introducing the notions of M-partitions and M-equivalence relations as the extensions of T-partitions and T-equivalence relations to the integral commutative cl-monoid M=(L, ≤, *), respectively, it is shown that the previous approaches on T-partitions and T-equivalence relations can be unified ...
openaire +1 more source
The Syntax of Many-Valued Relations
2016In this paper we show how many-valued relations syntactically can be formulated using powertype constructors. This in turn enables to describe the syntax of generalized relations in the starting point sense where the category sets and relations is isomorphic to the Kleisli category of the powerset monad over the category of sets. We can then generalize
openaire +1 more source
Aesthetic Value as a Relational Value
The Journal of Aesthetics and Art Criticism, 2022openaire +1 more source
Valued Relations Aggregation with the Borda Method
Journal of Multi-Criteria Decision Analysis, 1996Summary: The Borda method is a well-known method used to aggregate a profile of crisp binary relations into one weak order. We present a generalization of the Burda method, allowing it to aggregate a profile of valued relations. We give a characterization of the Borda method in this context and we show some links with the PROMETHEE method.
openaire +3 more sources