ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Satisfiability of logical functions and evolution

Beno Šircelj (2017) Satisfiability of logical functions and evolution. EngD thesis.

Download (2586Kb)


    This thesis contains experimental evaluation of results of Livnat et al. (Satisfiability and evolution, FOCS, 2014), who have shown that, given a logical function, the population of binary vectors converges to a population of function models, under the assumption of weak selection and product reproduction. Our experiments worked with population size 10000 and genotype length 28. We have experimentally confirmed their theoretical results and for a handful of special logical functions shown that the convergence speed towards the population of models matches the convergence speed of monotone logical functions. We have also run the experiments using crossover and mutations reproduction model. In this case we have for a random logical function experimentally detected convergence towards a population with high ratio of models. However, there are some classes of logical function for which we failed to achieve a similar convergence.

    Item Type: Thesis (EngD thesis)
    Keywords: genetic algorithm, boolean satisfiability problem, evolution, weak selection
    Number of Pages: 41
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    prof. dr. Gašper Fijavž246Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1537550019)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 3953
    Date Deposited: 14 Sep 2017 18:34
    Last Modified: 28 Sep 2017 11:04
    URI: http://eprints.fri.uni-lj.si/id/eprint/3953

    Actions (login required)

    View Item