All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Switch lists in the landscape of knowledge representations languages

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10454286" target="_blank" >RIV/00216208:11320/22:10454286 - isvavai.cz</a>

  • Result on the web

    <a href="https://journals.flvc.org/FLAIRS/article/view/130700/133833" target="_blank" >https://journals.flvc.org/FLAIRS/article/view/130700/133833</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.32473/flairs.v35i.130700" target="_blank" >10.32473/flairs.v35i.130700</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Switch lists in the landscape of knowledge representations languages

  • Original language description

    A switch-list representation (SLR) of a Boolean function is a compressed truth table representation of a Boolean function in which only the function value of the first row in the truth table and an ordered list of switches are stored. A switch is a Boolean vector whose function value differs from the value of the preceding Boolean vector in the truth table. In this short paper we outline scenarios under which SLRs constitute a better representation language than standard representation languages such as CNFs and OBDDs. Furthermore, we outline a possible approach to constructing a compiler from CNFs to SLRs which is a necessary tool for verifying practical usefulness of SLRs.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA19-19463S" target="_blank" >GA19-19463S: Boolean Representation Languages Complete for Unit Propagation</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 35th International Florida Artificial Intelligence Research Society Conference (FLAIRS 2022)

  • ISBN

  • ISSN

    2334-0762

  • e-ISSN

  • Number of pages

    4

  • Pages from-to

  • Publisher name

    LibraryPress@UF, an imprint of the University of Florida Press and the George A. Smathers Libraries at the University of Florida

  • Place of publication

    Florida

  • Event location

    Jensen Beach, Florida, USA

  • Event date

    May 15, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article