Abal-a language for boolean function representation and manipulation
Bibliographic Data
| ID | 20295525 |
|---|---|
| Authors | Iong Chen (Tricoci University of Beauty Culture), B D Carroll (Auburn University) |
| Year | 1977 |
| Volume | 20 |
| Issue | 1 |
| Pages | 70-72 |
| Publication date | 1977-02-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | IEEE Transactions on Education (JOURNAL) |
| Journal identifiers | ISSN: 0018-9359 • E-ISSN: 1557-9638 |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) (PUBLISHER) |
| DOI | 10.1109/te.1977.4321109 |
| OpenAlex | W2109250350 |
| Language | EN |
| References cited | 1 |
A language ABAL (Auburn Boolean Algebra Language) is described in this paper that permits machine representation and manipulation of Boolean functions. Functions may be specified in algebraic form or as lists of minterms or maxterms. Types of operations available in the language include functional form changes, simplification rules, prime implicant or prime implicate generation, functional minimization, functional combinations using Boolean operators, and truth table generation. ABAL is written in Basic-Plus for execution on a DEC PDP 11/40 RSTS/E System
Algebra over a field · Algebra representation · Algebraic number · Algorithm · Arithmetic · Boolean algebra · Boolean circuit · Boolean data type · Boolean expression · Boolean function · Circuit minimization for Boolean functions · Data mining · Implicant · Product term · Programming language · Representation (politics) · Table (database) · Truth table · Two-element Boolean algebra · Computer Science · Logic, programming, and type systems · Mathematics · Theoretical Computer Science
| Highly cited | No |
|---|