stanlogic 1.1.0__tar.gz

stanlogic-1.1.0/PKG-INFO

@@ -0,0 +1,15 @@
+Metadata-Version: 2.4
+Name: stanlogic
+Version: 1.1.0
+Summary: A Boolean simplification and inference library that integrates K-Map simplification and logical inference.
+Author: Stan's Technologies
+Author-email: Somtochukwu Stanislus Emeka-Onwuneme <somtochukwueo@outlook.com>
+License: MIT NC
+Keywords: boolean-algebra,kmap,logic-simplification,inference,symbolic-logic
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+Dynamic: author
+Dynamic: requires-python

stanlogic-1.1.0/pyproject.toml

@@ -0,0 +1,29 @@
+[build-system]
+requires = ["setuptools>=61.0", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "stanlogic"
+version = "1.1.0"
+authors = [
+  { name = "Somtochukwu Stanislus Emeka-Onwuneme", email = "somtochukwueo@outlook.com" }
+]
+description = "A Boolean simplification and inference library that integrates K-Map simplification and logical inference."
+readme = "README.md"
+requires-python = ">=3.8"
+license = { text = "MIT NC" }
+keywords = ["boolean-algebra", "kmap", "logic-simplification", "inference", "symbolic-logic"]
+classifiers = [
+    "Programming Language :: Python :: 3",
+    "License :: OSI Approved :: MIT License",
+    "Operating System :: OS Independent",
+]
+
+# Entry point for setuptools to find your code
+[tool.setuptools.packages.find]
+where = ["src"]
+
+# pytest configuration
+[tool.pytest.ini_options]
+testpaths = ["tests"]
+pythonpath = ["src"]

stanlogic-1.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

stanlogic-1.1.0/setup.py

@@ -0,0 +1,11 @@
+from setuptools import setup, find_packages
+
+setup(
+    name="StanLogic",
+    version="1.0.0",
+    packages=find_packages(where="src"),
+    package_dir={"": "src"},
+    author="Stan's Technologies",
+    description="An advanced KMap solver and logic simplification engine",
+    python_requires=">=3.8",
+)

stanlogic-1.1.0/src/StanLogic.egg-info/PKG-INFO

@@ -0,0 +1,15 @@
+Metadata-Version: 2.4
+Name: stanlogic
+Version: 1.1.0
+Summary: A Boolean simplification and inference library that integrates K-Map simplification and logical inference.
+Author: Stan's Technologies
+Author-email: Somtochukwu Stanislus Emeka-Onwuneme <somtochukwueo@outlook.com>
+License: MIT NC
+Keywords: boolean-algebra,kmap,logic-simplification,inference,symbolic-logic
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+Dynamic: author
+Dynamic: requires-python

stanlogic-1.1.0/src/StanLogic.egg-info/SOURCES.txt

@@ -0,0 +1,12 @@
+pyproject.toml
+setup.py
+src/StanLogic.egg-info/PKG-INFO
+src/StanLogic.egg-info/SOURCES.txt
+src/StanLogic.egg-info/dependency_links.txt
+src/StanLogic.egg-info/top_level.txt
+src/stanlogic/__init__.py
+src/stanlogic/kmapsolver.py
+src/stanlogic.egg-info/PKG-INFO
+src/stanlogic.egg-info/SOURCES.txt
+src/stanlogic.egg-info/dependency_links.txt
+src/stanlogic.egg-info/top_level.txt

stanlogic-1.1.0/src/StanLogic.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

stanlogic-1.1.0/src/StanLogic.egg-info/top_level.txt

@@ -0,0 +1 @@
+stanlogic

stanlogic-1.1.0/src/stanlogic/__init__.py

@@ -0,0 +1,9 @@
+# kmap_algorithm/__init__.py
+
+from .kmapsolver import KMapSolver
+
+__all__ = [
+    "KMapSolver",
+]
+
+__version__ = "1.1.0"

stanlogic-1.1.0/src/stanlogic/kmapsolver.py

@@ -0,0 +1,298 @@
+"""
+stanclustlogic.py, library to easily solve 2-4 variable kmaps.
+
+Developed from kmapsolver.py, kmap_solver_prototype.py
+""" 
+
+# Author: Somtochukwu Stanislus Emeka-Onwuneme 
+# Publication Date: 8th September, 2025
+# Copyright © 2025 Somtochukwu Stanislus Emeka-Onwuneme
+#---------------------------------------------------------
+
+from collections import defaultdict
+
+class KMapSolver:
+    def __init__(self, kmap, convention = "vranseic"):
+        """
+        Initialize with a given K-map.
+        kmap: 2D list with values 0, 1, or 'd'
+        """
+        self.kmap = kmap
+        self.num_rows = len(kmap)
+        self.num_cols = len(kmap[0])
+        self.convention = convention.lower().strip()
+
+        # Determine number of variables (2, 3, or 4)
+        size = self.num_rows * self.num_cols
+        if size == 4:
+            self.num_vars = 2
+            self.row_labels = ["0", "1"]
+            self.col_labels = ["0", "1"]
+        elif size == 8:
+            self.num_vars = 3
+            self.row_labels = ["0", "1"]
+            self.col_labels = ["00", "01", "11", "10"]
+        elif size == 16:
+            self.num_vars = 4
+            self.row_labels = ["00", "01", "11", "10"]
+            self.col_labels = ["00", "01", "11", "10"]
+        else:
+            raise ValueError("K-map must be 2x2 (2 vars), 2x4/4x2 (3 vars), or 4x4 (4 vars)")
+
+        # Group sizes (powers of 2 only)
+        self.group_sizes = [(1,1),(1,2),(2,1),(2,2),
+                            (1,4),(4,1),(2,4),(4,2),(4,4)]
+
+        # ---- Optimizations: precompute mapping and prune group sizes ----
+        # keep only group sizes that actually fit the K-map
+        self.group_sizes = [(h,w) for (h,w) in self.group_sizes if h <= self.num_rows and w <= self.num_cols]
+
+        # Precompute cell index (minterm/maxterm index) and bit-strings for each cell.
+        # Use _cell_to_bits/_cell_to_term (methods are available on the instance)
+        self._cell_index = [[self._cell_to_term(r, c) for c in range(self.num_cols)] for r in range(self.num_rows)]
+        self._cell_bits = [[self._cell_to_bits(r, c) for c in range(self.num_cols)] for r in range(self.num_rows)]
+        # map minterm index -> (r, c)
+        self._index_to_rc = {self._cell_index[r][c]: (r, c) for r in range(self.num_rows) for c in range(self.num_cols)}
+
+    # ---------- Utility functions ---------- #
+    def _cell_to_term(self, r, c):
+        """Convert (row, col) to a minterm index."""
+        bits = self.col_labels[c] + self.row_labels[r]
+        return int(bits, 2)
+    
+    # def _cell_to_maxterm(self, r, c):
+    #     """Convert (row, col) to a maxterm index."""
+    #     bits = self.col_labels[c] + self.row_labels[r]
+    #     return int(bits, 2)
+
+    def _cell_to_bits(self, r, c):
+        """Return the bit string representing (row, col) based on the convention."""
+        if self.convention == "mano_kime":
+            # Mano-Kime → rows = x1x2, cols = x3x4
+            bits = self.row_labels[r] + self.col_labels[c]
+        else:
+            # Vranesic → rows = x3x4, cols = x1x2
+            bits = self.col_labels[c] + self.row_labels[r]
+        return bits
+
+
+    def _get_group_coords(self, r, c, h, w):
+        """Get wrapped coordinates for a group starting at (r,c)."""
+        return [((r+i) % self.num_rows, (c+j) % self.num_cols)
+                for i in range(h) for j in range(w)]
+
+    # ---------- Group finding ---------- #
+    def find_all_groups(self, allow_dontcare=False):
+        """Find all groups of 1’s (and optionally 'd'). Return integer bitmasks for groups."""
+        groups = set()
+        for r in range(self.num_rows):
+            for c in range(self.num_cols):
+                for h, w in self.group_sizes:
+                    coords = self._get_group_coords(r, c, h, w)
+
+                    if allow_dontcare:
+                        if all(self.kmap[rr][cc] in (1, 'd') for rr, cc in coords) and \
+                           any(self.kmap[rr][cc] == 1 for rr, cc in coords):
+                            mask = 0
+                            for rr, cc in coords:
+                                mask |= 1 << self._cell_index[rr][cc]
+                            groups.add(mask)
+                    else:
+                        if all(self.kmap[rr][cc] == 1 for rr, cc in coords):
+                            mask = 0
+                            for rr, cc in coords:
+                                mask |= 1 << self._cell_index[rr][cc]
+                            groups.add(mask)
+        return list(groups)
+
+    def find_all_groups_pos(self, allow_dontcare=False):
+        """Find all groups of 0's (and optionally 'd') for POS. Return integer bitmasks."""
+        groups = set()
+        for r in range(self.num_rows):
+            for c in range(self.num_cols):
+                for h, w in self.group_sizes:
+                    coords = self._get_group_coords(r, c, h, w)
+
+                    if allow_dontcare:
+                        if all(self.kmap[rr][cc] in (0, 'd') for rr, cc in coords) and \
+                           any(self.kmap[rr][cc] == 0 for rr, cc in coords):
+                            mask = 0
+                            for rr, cc in coords:
+                                mask |= 1 << self._cell_index[rr][cc]
+                            groups.add(mask)
+                    else:
+                        if all(self.kmap[rr][cc] == 0 for rr, cc in coords):
+                            mask = 0
+                            for rr, cc in coords:
+                                mask |= 1 << self._cell_index[rr][cc]
+                            groups.add(mask)
+        return list(groups)
+    
+    def filter_prime_implicants(self, groups):
+        """Remove groups that are strict subsets of others. groups are integer masks."""
+        primes = []
+        # sort by bit_count descending to allow early pruning (larger groups first)
+        groups_sorted = sorted(groups, key=lambda g: g.bit_count(), reverse=True)
+        for i, g in enumerate(groups_sorted):
+            is_subset = False
+            for other in groups_sorted:
+                if other == g:
+                    continue
+                # if g is subset of other
+                if (g & other) == g:
+                    is_subset = True
+                    break
+            if not is_subset:
+                primes.append(g)
+        return primes
+
+    # ---------- Boolean simplification ---------- #
+    def _simplify_group_bits(self, bits_list):
+        bits = list(bits_list[0])
+        for b in bits_list[1:]:
+            for i in range(self.num_vars):
+                if bits[i] != b[i]:
+                    bits[i] = '-'
+
+        vars_ = [f"x{i+1}" for i in range(self.num_vars)]
+        term = []
+        for i, b in enumerate(bits):
+            if b == '0':
+                term.append(vars_[i] + "'")
+            elif b == '1':
+                term.append(vars_[i])
+        return "".join(term)
+    
+    def _simplify_group_bits_pos(self, bits_list):
+        """Convert group bits to POS term."""
+        bits = list(bits_list[0])
+        for b in bits_list[1:]:
+            for i in range(self.num_vars):
+                if bits[i] != b[i]:
+                    bits[i] = '-'
+
+        vars_ = [f"x{i+1}" for i in range(self.num_vars)]
+        term = []
+        for i, b in enumerate(bits):
+            if b == '1':
+                term.append(vars_[i] + "'")
+            elif b == '0':
+                term.append(vars_[i])
+        return "(" + " + ".join(term) + ")"
+
+    # ---------- Main minimization ---------- #
+    def minimize(self, form='sop'):
+        """
+        Minimize the K-map expression.
+        Args:
+            form: 'sop' for Sum of Products or 'pos' for Product of Sums
+        Returns:
+            tuple: (list of terms, string expression)
+        """
+        if form.lower() not in ['sop', 'pos']:
+            raise ValueError("form must be either 'sop' or 'pos'")
+
+        target_val = 0 if form.lower() == 'pos' else 1
+
+        # Choose appropriate group-finding and simplifier
+        if form.lower() == 'pos':
+            groups = self.find_all_groups_pos(allow_dontcare=True)
+            simplify_method = self._simplify_group_bits_pos
+            join_operator = " * "
+        else:
+            groups = self.find_all_groups(allow_dontcare=True)
+            simplify_method = self._simplify_group_bits
+            join_operator = " + "
+
+        # Step 2: reduce to prime implicants (groups are bitmasks)
+        prime_groups = self.filter_prime_implicants(groups)
+
+        # Step 3: compute terms and covers (use bitmasks for covers)
+        prime_terms = []
+        prime_covers = []
+        for gmask in prime_groups:
+            # collect only actual minterms (target_val) covered by this group
+            cover_mask = 0
+            bits_list = []
+            temp = gmask
+            while temp:
+                low = temp & -temp
+                idx = low.bit_length() - 1
+                temp -= low
+                r, c = self._index_to_rc[idx]
+                if self.kmap[r][c] == target_val:
+                    cover_mask |= 1 << idx
+                # include bits for simplification (include don't-cares as they are part of the group)
+                bits_list.append(self._cell_bits[r][c])
+            if cover_mask == 0:
+                continue
+            term_str = simplify_method(bits_list)
+            prime_terms.append(term_str)
+            prime_covers.append(cover_mask)
+
+        # Step 4: build prime implicant chart using masks
+        minterm_to_primes = defaultdict(list)
+        all_minterms_mask = 0
+        for p_idx, cover in enumerate(prime_covers):
+            all_minterms_mask |= cover
+            temp = cover
+            while temp:
+                low = temp & -temp
+                idx = low.bit_length() - 1
+                temp -= low
+                minterm_to_primes[idx].append(p_idx)
+
+        # Step 5: essential primes
+        essential_indices = set()
+        for m, primes in minterm_to_primes.items():
+            if len(primes) == 1:
+                essential_indices.add(primes[0])
+
+        essential_terms = [prime_terms[i] for i in sorted(essential_indices)]
+
+        # Step 6: mark covered by essentials
+        covered_mask = 0
+        for i in essential_indices:
+            covered_mask |= prime_covers[i]
+
+        # Step 7: greedy covering (bitmask-based)
+        remaining_mask = all_minterms_mask & ~covered_mask
+        selected = set(essential_indices)
+        while remaining_mask:
+            best_idx, best_cover_count = None, -1
+            for idx in range(len(prime_covers)):
+                if idx in selected:
+                    continue
+                cover = prime_covers[idx] & remaining_mask
+                count = cover.bit_count()
+                if count > best_cover_count:
+                    best_cover_count = count
+                    best_idx = idx
+            if best_idx is None or best_cover_count == 0:
+                break
+            selected.add(best_idx)
+            covered_mask |= prime_covers[best_idx]
+            remaining_mask = all_minterms_mask & ~covered_mask
+
+        # Step 8: remove redundant terms using masks
+        def covers_with_indices(indices):
+            mask = 0
+            for i in indices:
+                mask |= prime_covers[i]
+            return mask
+
+        chosen = set(selected)
+        for idx in list(sorted(chosen)):
+            trial = chosen - {idx}
+            if covers_with_indices(trial) == covers_with_indices(chosen):
+                chosen = trial
+
+        final_terms = [prime_terms[i] for i in sorted(chosen)]
+        return final_terms, join_operator.join(final_terms)
+    
+    # ---------- Display ---------- #
+    def print_kmap(self):
+        """Pretty print the K-map with headers."""
+        print("     " + "  ".join(self.col_labels))
+        for i, row in enumerate(self.kmap):
+            print(f"{self.row_labels[i]}   " + "  ".join(str(val) for val in row))