Skip Navigation

The Computer Journal 1977 20(4):356-358; doi:10.1093/comjnl/20.4.356
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wilson, J. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Boolean simplification and integer inequalities

J. M. Wilson *

Department of Management Studies, Loughborough University of Technology, Loughborough, UK

A method for the minimisation of Boolean expressions is presented. The algorithm has as its basis the Quine approach, but it is geared to handling larger sets of Boolean variables, rather than small sets of variable encountered in traditional examples. These larger sets of variables occur when a Boolean minimisation process is incorporated in an Integer Programming algorithm.

Received December 1975.

* Department of Management Studies, Loughborough University of Technology, Loughborough, Leicestershire LE11 3TU


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.