The student is expected to study the related literature from the area of knowledge compilation and then concentrate on switch-list representations (SLR) of Boolean functions. The aim of this research is to find efficient algorithms for standard queries performed directly on SLRs, in particular for equivalence testing (EQ) and sentential entailment (SE) for which only indirect algorithms (which compile the input SLRs into OBDDs and only then answer the query) are currently known. A systematic study of other queries and/or transformations is also possible. The work should be mostly theoretical - design of algorithms and analysis of their properties (in particular of their time complexity), however practical implementations and comparison studies of different implementations may be also considered.
Seznam odborné literatury
Darwiche, A., & Marquis, P. (2002). A knowledge compilation map. Journal Of Arti�ficial Intelligence Research, 17, 229-264.
Čepek,O.; Chromý,M. (2020) Properties of Switch-List Representations of Boolean Functions. Journal of Artificial Intelligence Research, 69, 501-529.