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

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

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

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

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

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

Encoding Markov Logic Networks in Possibilistic Logic

Markov logic uses weighted formulas to compactly encode a probability distribution over possible worlds. Despite the use of logical formulas, Markov logic networks (MLNs) can be difficult to interpret, due to the often counter-intuitive meaning of their weights. To address this issue, we propose a method to construct a possibilistic logic theory that exactly captures what can be derived from a given MLN using maximum a posteriori (MAP) inference. Unfortunately, the size of this theory is exponential in general. We therefore also propose two methods which can derive compact theories that still capture MAP inference, but only for specific types of evidence. These theories can be used, among others, to make explicit the hidden assumptions underlying an MLN or to explain the predictions it makes.Comment: Extended version of a paper appearing in UAI 201

Possibilistic Boolean games: strategic reasoning under incomplete information

Boolean games offer a compact alternative to normal-form games, by encoding the goal of each agent as a propositional formula. In this paper, we show how this framework can be naturally extended to model situations in which agents are uncertain about other agents' goals. We first use uncertainty measures from possibility theory to semantically define (solution concepts to) Boolean games with incomplete information. Then we present a syntactic characterization of these semantics, which can readily be implemented, and we characterize the computational complexity