A Sound and Complete Axiomatization of Majority- Logic

Manipulating logic functions via majority operators recently drew the attention of researchers in computer science. For example, circuit optimization based on majority operators enables superior results as compared to traditional synthesis tools. Also, the Boolean satisfiability problem finds new so...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computers Ročník 65; číslo 9; s. 2889 - 2895
Hlavní autoři: Amaru, Luca, Gaillardon, Pierre-Emmanuel, Chattopadhyay, Anupam, De Micheli, Giovanni
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 01.09.2016
Témata:
Logic programming
ISSN:0018-9340, 1557-9956
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Manipulating logic functions via majority operators recently drew the attention of researchers in computer science. For example, circuit optimization based on majority operators enables superior results as compared to traditional synthesis tools. Also, the Boolean satisfiability problem finds new solution approaches when described in terms of majority decisions. To support computer logic applications based on majority, a sound and complete set of axioms is required. Most of the recent advances in majority logic deal only with ternary majority (MAJ-3) operators because the axiomatization with solely MAJ-3 and complementation operators is well understood. However, it is of interest extending such axiomatization to [Formula Omitted]-ary majority operators (MAJ- [Formula Omitted]) from both the theoretical and practical perspective. In this work, we address this issue by introducing a sound and complete axiomatization of MAJ- [Formula Omitted] logic. Our axiomatization naturally includes existing MAJ-3 and MAJ-5 axiomatic systems. Based on this general set of axioms, computer applications can now fully exploit the expressive power of majority logic.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2015.2506566