336 research outputs found

    Relative aggregation operator in database fuzzy querying

    Get PDF
    Fuzzy selection criteria querying relational databases include vague terms; they usually refer linguistic values form the attribute linguistic domains, defined as fuzzy sets. Generally, when a vague query is processed, the definitions of vague terms must already exist in a knowledge base. But there are also cases when vague terms must be dynamically defined, when a particular operation is used to aggregate simple criteria in a complex selection. The paper presents a new aggregation operator and the corresponding algorithm to evaluate the fuzzy query

    Aggregated fuzzy answer set programming

    Get PDF
    Fuzzy Answer Set programming (FASP) is an extension of answer set programming (ASP), based on fuzzy logic. It allows to encode continuous optimization problems in the same concise manner as ASP allows to model combinatorial problems. As a result of its inherent continuity, rules in FASP may be satisfied or violated to certain degrees. Rather than insisting that all rules are fully satisfied, we may only require that they are satisfied partially, to the best extent possible. However, most approaches that feature partial rule satisfaction limit themselves to attaching predefined weights to rules, which is not sufficiently flexible for most real-life applications. In this paper, we develop an alternative, based on aggregator functions that specify which (combination of) rules are most important to satisfy. We extend upon previous work by allowing aggregator expressions to define partially ordered preferences, and by the use of a fixpoint semantics

    On the LL-valued categories of LL-EE-ordered sets

    Get PDF
    summary:The aim of this paper is to construct an LL-valued category whose objects are LL-EE-ordered sets. To reach the goal, first, we construct a category whose objects are LL-EE-ordered sets and morphisms are order-preserving mappings (in a fuzzy sense). For the morphisms of the category we define the degree to which each morphism is an order-preserving mapping and as a result we obtain an LL-valued category. Further we investigate the properties of this category, namely, we observe some special objects, special morphisms and special constructions
    • …
    corecore