Switch lists in the landscape of knowledge representation languages
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 th...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
LibraryPress@UF
2022-05-01
|
| Series: | Proceedings of the International Florida Artificial Intelligence Research Society Conference |
| Online Access: | https://journals.flvc.org/FLAIRS/article/view/130700 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849763295084412928 |
|---|---|
| author | Ondrej Cepek |
| author_facet | Ondrej Cepek |
| author_sort | Ondrej Cepek |
| collection | DOAJ |
| 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. |
| format | Article |
| id | doaj-art-fe7a6de4ca3c47459f82e805d12a26ef |
| institution | DOAJ |
| issn | 2334-0754 2334-0762 |
| language | English |
| publishDate | 2022-05-01 |
| publisher | LibraryPress@UF |
| record_format | Article |
| series | Proceedings of the International Florida Artificial Intelligence Research Society Conference |
| spelling | doaj-art-fe7a6de4ca3c47459f82e805d12a26ef2025-08-20T03:05:26ZengLibraryPress@UFProceedings of the International Florida Artificial Intelligence Research Society Conference2334-07542334-07622022-05-013510.32473/flairs.v35i.13070066899Switch lists in the landscape of knowledge representation languagesOndrej Cepek0Charles UniversityA 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.https://journals.flvc.org/FLAIRS/article/view/130700 |
| spellingShingle | Ondrej Cepek Switch lists in the landscape of knowledge representation languages Proceedings of the International Florida Artificial Intelligence Research Society Conference |
| title | Switch lists in the landscape of knowledge representation languages |
| title_full | Switch lists in the landscape of knowledge representation languages |
| title_fullStr | Switch lists in the landscape of knowledge representation languages |
| title_full_unstemmed | Switch lists in the landscape of knowledge representation languages |
| title_short | Switch lists in the landscape of knowledge representation languages |
| title_sort | switch lists in the landscape of knowledge representation languages |
| url | https://journals.flvc.org/FLAIRS/article/view/130700 |
| work_keys_str_mv | AT ondrejcepek switchlistsinthelandscapeofknowledgerepresentationlanguages |