1,268 research outputs found

    Towards the implementation of a preference-and uncertain-aware solver using answer set programming

    Get PDF
    Logic programs with possibilistic ordered disjunction (or LPPODs) are a recently defined logic-programming framework based on logic programs with ordered disjunction and possibilistic logic. The framework inherits the properties of such formalisms and merging them, it supports a reasoning which is nonmonotonic, preference-and uncertain-aware. The LPPODs syntax allows to specify 1) preferences in a qualitative way, and 2) necessity values about the certainty of program clauses. As a result at semantic level, preferences and necessity values can be used to specify an order among program solutions. This class of program therefore fits well in the representation of decision problems where a best option has to be chosen taking into account both preferences and necessity measures about information. In this paper we study the computation and the complexity of the LPPODs semantics and we describe the algorithm for its implementation following on Answer Set Programming approach. We describe some decision scenarios where the solver can be used to choose the best solutions by checking whether an outcome is possibilistically preferred over another considering preferences and uncertainty at the same time.Postprint (published version

    A robust fuzzy possibilistic AHP approach for partner selection in international strategic alliance

    Get PDF
    The international strategic alliance is an inevitable solution for making competitive advantage and reducing the risk in today’s business environment. Partner selection is an important part in success of partnerships, and meanwhile it is a complicated decision because of various dimensions of the problem and inherent conflicts of stockholders. The purpose of this paper is to provide a practical approach to the problem of partner selection in international strategic alliances, which fulfills the gap between theories of inter-organizational relationships and quantitative models. Thus, a novel Robust Fuzzy Possibilistic AHP approach is proposed for combining the benefits of two complementary theories of inter-organizational relationships named, (1) Resource-based view, and (2) Transaction-cost theory and considering Fit theory as the perquisite of alliance success. The Robust Fuzzy Possibilistic AHP approach is a noveldevelopment of Interval-AHP technique employing robust formulation; aimed at handling the ambiguity of the problem and let the use of intervals as pairwise judgments. The proposed approach was compared with existing approaches, and the results show that it provides the best quality solutions in terms of minimum error degree. Moreover, the framework implemented in a case study and its applicability were discussed

    Penghasilan manual rjngkas penggunaan alat Total Station Sokkia Set5f dan Perisian Sdr Mapping & Design untuk automasi ukur topografi

    Get PDF
    Projek ini dilaksanakan untuk menghasilkan manual ringkas penggunaan alat Total Station Sokkia SET5F dan Perisian SDR Mapping & Design dalam menghasilkan pelan topografi yang lengkap mengikut konsep field to finish. Manual telah dihasilkan dalam dua bentuk iaitu buku dan CD-ROM. Manual ini telah dinilai berdasarkan data yang diperolehi daripada 7 orang responden melalui kaedah Borang Penilaian Manual. Analisis data dilakukan menggunakan perisian SPSS versi 11.0. Hasil analisis skor min menunjukkan kesemua responden bersetuju bahawa manual dalam bentuk buku ini menarik Min ( M ) ^ ^ dan Sisihan Piawai (SD) = .535 tetapi kurang interaktif (M) = 2.29 dan (SD) = 0.488. Berbanding dengan manual dalam format CD-ROM yang mencatat nilai (M) = 3.57 dan (SD) = 0.535 semua responden bersetuju bahawa manual ini mesra pengguna dan lebih interakti

    Characterizing and Extending Answer Set Semantics using Possibility Theory

    Full text link
    Answer Set Programming (ASP) is a popular framework for modeling combinatorial problems. However, ASP cannot easily be used for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, where this weight is interpreted as the certainty with which the conclusion can be established when the body is known to hold. As such, it allows us to model and reason about uncertain information in an intuitive way. In this paper we present new semantics for PASP, in which rules are interpreted as constraints on possibility distributions. Special models of these constraints are then identified as possibilistic answer sets. In addition, since ASP is a special case of PASP in which all the rules are entirely certain, we obtain a new characterization of ASP in terms of constraints on possibility distributions. This allows us to uncover a new form of disjunction, called weak disjunction, that has not been previously considered in the literature. In addition to introducing and motivating the semantics of weak disjunction, we also pinpoint its computational complexity. In particular, while the complexity of most reasoning tasks coincides with standard disjunctive ASP, we find that brave reasoning for programs with weak disjunctions is easier.Comment: 39 pages and 16 pages appendix with proofs. This article has been accepted for publication in Theory and Practice of Logic Programming, Copyright Cambridge University Pres

    Experts’ consensus to identify elements of career management competencies in Work-Based Learning (WBL) program using Fuzzy Delphi Analysis

    Get PDF
    This study aimed to obtain experts‘ opinion and consensus on the elements of career management competencies that can be developed through the Work-Based Learning (WBL) program in polytechnic

    Fuzzy Real Investment Valuation Model for Giga-Investments, and a Note on Giga-Investment Lifecycle and Valuation

    Get PDF
    Very large industrial real investments are different from financial investments and from small real investments, even so, their profitability is commonly valued with the same methods. A definition of a group of very large industrial real investments is made, by requiring three common characteristics. The decision support needs arising from these characteristics are discussed and a summary of existing methods to value and to provide decision support for large industrial investments is presented. A model built specifically to support investment decisions of very large industrial real investments and a numerical application of the model are presented. The model is discussed and commented. A note is made on an observation regarding the giga-investment lifecycle and its effect on giga-investment valuation.Large industrial investments; Profitability analysis; Fuzzy corporate finance; Capital Budgeting

    Fuzzy argumentation for trust

    No full text
    In an open Multi-Agent System, the goals of agents acting on behalf of their owners often conflict with each other. Therefore, a personal agent protecting the interest of a single user cannot always rely on them. Consequently, such a personal agent needs to be able to reason about trusting (information or services provided by) other agents. Existing algorithms that perform such reasoning mainly focus on the immediate utility of a trusting decision, but do not provide an explanation of their actions to the user. This may hinder the acceptance of agent-based technologies in sensitive applications where users need to rely on their personal agents. Against this background, we propose a new approach to trust based on argumentation that aims to expose the rationale behind such trusting decisions. Our solution features a separation of opponent modeling and decision making. It uses possibilistic logic to model behavior of opponents, and we propose an extension of the argumentation framework by Amgoud and Prade to use the fuzzy rules within these models for well-supported decisions
    corecore