Saltar al contenido

Dígito BCD mayor que cinco: mapa de Karnaugh de cuatro variables con indiferencias

¿Un dígito BCD es mayor que cinco? La función Σm(D, C, B, A; 6, 7, 8, 9) bajo el supuesto de que los códigos 10 a 15 nunca ocurren. Seis indiferencias permiten al mapa de Karnaugh derivar D OR (C AND B), de dos términos.

Las entradas D, C, B, A son los bits 8, 4, 2 y 1 de un dígito decimal, y la salida es verdadera para 6, 7, 8 y 9, que es la lista de mintérminos de la fórmula. El supuesto k1, NOT (D AND (C OR B)), dice que los cuatro bits codifican siempre un dígito de 0 a 9, así que los seis códigos de 10 a 15 quedan excluidos; en la tabla de dieciséis filas la columna del supuesto es falsa exactamente en esas seis. La lectura del motor reformula la fórmula como las filas 6, 7, 8 y 9 de la tabla.

La tautología se viola con las cuatro entradas en FALSO, y la satisfacibilidad se cumple con el testigo D = FALSO, C = VERDADERO, B = VERDADERO, A = FALSO, el dígito 6. El simplificador no encontró ninguna ley aplicable a una lista de mintérminos. El conversor la desarrolla en una FND de cuatro términos y dieciséis literales y una FNC de doce cláusulas y 48 literales; las compuertas de ese desarrollo son 95 NAND y 191 NOR. El mapa de Karnaugh, con 6 indiferencias del supuesto, dibuja dos grupos, D y C AND B, dos implicantes primos, y deriva D OR (C AND B), equivalente dentro de los supuestos.

Las pruebas de umbral sobre valores codificados son comunes en decodificadores, en comprobaciones de rango sobre enumeraciones y en código de validación, y esta muestra cuánto rinde un supuesto honesto: un desarrollo de cuatro términos se queda en dos porque el mapa puede tratar los códigos imposibles como le convenga. Lo que hay que vigilar es esa conveniencia. D OR (C AND B) es verdadero en los códigos 10 a 15, así que si llega uno de esos códigos la prueba acortada informa de «mayor que cinco» para entradas que la original nunca especificó. El supuesto tiene que ser cierto en el sistema, no solo en el modelo.

greater_than_five := Σm(D, C, B, A; 6, 7, 8, 9) · salida

Supuestos: NOT (D AND (C OR B)) (The four bits encode a decimal digit 0 to 9 (BCD); codes 10 to 15 never occur.)

Comprobaciones exactas

¿Siempre verdadera (tautología)? No Contraejemplo: D = F, C = F, B = F, A = F · Exhaustively checked and solver cross-checked · 1 filas
¿Siempre falsa (contradicción)? No Contraejemplo: D = F, C = V, B = V, A = F · Exhaustively checked and solver cross-checked · 7 filas
¿Puede ser verdadera? Sí Asignación de ejemplo: D = F, C = V, B = V, A = F · Exhaustively checked and solver cross-checked · 7 filas
¿Son consistentes los supuestos? Sí Asignación de ejemplo: D = F, C = F, B = F, A = F · Exhaustively checked and solver cross-checked · 1 filas

Tabla de verdad (16 filas)

Dígito BCD mayor que cinco: mapa de Karnaugh de cuatro variables con indiferencias
#DCBAgreater_than_fivek1Ámbito
0FALSOFALSOFALSOFALSOFALSOVERDADEROen ámbito
1FALSOFALSOFALSOVERDADEROFALSOVERDADEROen ámbito
2FALSOFALSOVERDADEROFALSOFALSOVERDADEROen ámbito
3FALSOFALSOVERDADEROVERDADEROFALSOVERDADEROen ámbito
4FALSOVERDADEROFALSOFALSOFALSOVERDADEROen ámbito
5FALSOVERDADEROFALSOVERDADEROFALSOVERDADEROen ámbito
6FALSOVERDADEROVERDADEROFALSOVERDADEROVERDADEROen ámbito
7FALSOVERDADEROVERDADEROVERDADEROVERDADEROVERDADEROen ámbito
8VERDADEROFALSOFALSOFALSOVERDADEROVERDADEROen ámbito
9VERDADEROFALSOFALSOVERDADEROVERDADEROVERDADEROen ámbito
10VERDADEROFALSOVERDADEROFALSOFALSOFALSOexcluida
11VERDADEROFALSOVERDADEROVERDADEROFALSOFALSOexcluida
12VERDADEROVERDADEROFALSOFALSOFALSOFALSOexcluida
13VERDADEROVERDADEROFALSOVERDADEROFALSOFALSOexcluida
14VERDADEROVERDADEROVERDADEROFALSOFALSOFALSOexcluida
15VERDADEROVERDADEROVERDADEROVERDADEROFALSOFALSOexcluida

Lectura en lenguaje claro

Principiantegreater_than_five es verdadero exactamente cuando la fila de la tabla de verdad de (D, C, B, A) es una de las filas 6, 7, 8 y 9.
En todos los demás casos, greater_than_five es falso.
Sobre los operadores:
- Σm enumera las filas de la tabla de verdad (mintérminos) en las que la fórmula es verdadera. Las filas se numeran desde 0 y la primera entrada indicada es el bit más significativo.
Intermediogreater_than_five es verdadero exactamente cuando la fila de la tabla de verdad de (D, C, B, A) es una de las filas 6, 7, 8 y 9.
En todos los demás casos, greater_than_five es falso.
Avanzadogreater_than_five es verdadero exactamente cuando la fila de la tabla de verdad de (D, C, B, A) es una de las filas 6, 7, 8 y 9 [suma canónica de mintérminos (FND)].
En todos los demás casos, greater_than_five es falso.
Notación formal: Σm(D, C, B, A; 6, 7, 8, 9)

Diagrama lógico

BCD digit greater than five: four-variable K-map with don’t-cares BCD digit greater than five: four-variable K-map with don’t-cares D C B A greater_than_five k1ASSUME Σm(6,7,8,9)DCBA NOT AND OR
BCD digit greater than five: four-variable K-map with don’t-cares BCD digit greater than five: four-variable K-map with don’t-cares D C B A greater_than_five k1ASSUME Σm(6,7,8,9)DCBA NOT AND OR

Simplificación paso a paso

El motor no encontró ninguna ley que acorte esta expresión; ya es tan corta como sus leyes de reescritura permiten.

Σm(D, C, B, A; 6, 7, 8, 9)

Mapa de Karnaugh

DC \ BA
00
01
11
10
00
0m0
0m1
0m3
0m2
01
0m4
0m5
1m7
1m6
11
Xm12
Xm13
Xm15
Xm14
10
1m8
1m9
Xm11
Xm10
  1. celdas m8, m9, m10, m11, m12, m13, m14, m15D
  2. celdas m6, m7, m14, m15C AND B
D OR (C AND B) · Derived D OR (C AND B). The groups use don't-care cells, so the result is only claimed within the assumptions. Equivalent on every assignment the assumptions allow (scoped: it was derived using the assumptions); no claim is made outside them.

6 cells excluded by the confirmed assumptions (k1) are marked don't-care. An expression derived with them is equivalent only within the assumptions.

Mintérminos y maxtérminos

greater_than_five(D, C, B, A) = Σm(6, 7, 8, 9)greater_than_five(D, C, B, A) = ΠM(0, 1, 2, 3, 4, 5, 10, 11, 12, 13, 14, 15)

Orden de variables: D, C, B, A · 16 filas

Formas normales

Forma normal conjuntiva (FNC)

(D OR C OR B OR A) AND (D OR C OR B OR NOT A) AND (D OR C OR NOT B OR A) AND (D OR C OR NOT B OR NOT A) AND (D OR NOT C OR B OR A) AND (D OR NOT C OR B OR NOT A) AND (NOT D OR C OR NOT B OR A) AND (NOT D OR C OR NOT B OR NOT A) AND (NOT D OR NOT C OR B OR A) AND (NOT D OR NOT C OR B OR NOT A) AND (NOT D OR NOT C OR NOT B OR A) AND (NOT D OR NOT C OR NOT B OR NOT A)

12 cláusulas, 48 literales · complete · Desarrollo en mintérminos ×1

Forma normal disyuntiva (FND)

(D AND NOT C AND NOT B AND A) OR (D AND NOT C AND NOT B AND NOT A) OR (NOT D AND C AND B AND A) OR (NOT D AND C AND B AND NOT A)

4 términos, 16 literales · complete · Desarrollo en mintérminos ×1

Solo NAND, solo NOR

Forma solo con NAND

NAND(NAND(NAND(NAND(NAND(NAND(NAND(D, D), C), NAND(NAND(D, D), C)), NAND(NAND(B, NAND(A, A)), NAND(B, NAND(A, A)))), NAND(NAND(NAND(NAND(D, D), C), NAND(NAND(D, D), C)), NAND(NAND(B, A), NAND(B, A)))), NAND(NAND(NAND(NAND(NAND(D, D), C), NAND(NAND(D, D), C)), NAND(NAND(B, NAND(A, A)), NAND(B, NAND(A, A)))), NAND(NAND(NAND(NAND(D, D), C), NAND(NAND(D, D), C)), NAND(NAND(B, A), NAND(B, A))))), NAND(NAND(NAND(NAND(NAND(D, NAND(C, C)), NAND(D, NAND(C, C))), NAND(NAND(NAND(B, B), NAND(A, A)), NAND(NAND(B, B), NAND(A, A)))), NAND(NAND(NAND(D, NAND(C, C)), NAND(D, NAND(C, C))), NAND(NAND(NAND(B, B), A), NAND(NAND(B, B), A)))), NAND(NAND(NAND(NAND(D, NAND(C, C)), NAND(D, NAND(C, C))), NAND(NAND(NAND(B, B), NAND(A, A)), NAND(NAND(B, B), NAND(A, A)))), NAND(NAND(NAND(D, NAND(C, C)), NAND(D, NAND(C, C))), NAND(NAND(NAND(B, B), A), NAND(NAND(B, B), A))))))

95 compuertas · equivalencia verificada en todas las filas

Forma solo con NOR

NOR(NOR(NOR(NOR(NOR(NOR(NOR(D, NOR(C, C)), NOR(D, NOR(C, C))), NOR(NOR(NOR(B, B), A), NOR(NOR(B, B), A))), NOR(NOR(NOR(D, NOR(C, C)), NOR(D, NOR(C, C))), NOR(NOR(NOR(B, B), NOR(A, A)), NOR(NOR(B, B), NOR(A, A))))), NOR(NOR(NOR(NOR(D, NOR(C, C)), NOR(D, NOR(C, C))), NOR(NOR(NOR(B, B), A), NOR(NOR(B, B), A))), NOR(NOR(NOR(D, NOR(C, C)), NOR(D, NOR(C, C))), NOR(NOR(NOR(B, B), NOR(A, A)), NOR(NOR(B, B), NOR(A, A)))))), NOR(NOR(NOR(NOR(NOR(NOR(D, D), C), NOR(NOR(D, D), C)), NOR(NOR(B, A), NOR(B, A))), NOR(NOR(NOR(NOR(D, D), C), NOR(NOR(D, D), C)), NOR(NOR(B, NOR(A, A)), NOR(B, NOR(A, A))))), NOR(NOR(NOR(NOR(NOR(D, D), C), NOR(NOR(D, D), C)), NOR(NOR(B, A), NOR(B, A))), NOR(NOR(NOR(NOR(D, D), C), NOR(NOR(D, D), C)), NOR(NOR(B, NOR(A, A)), NOR(B, NOR(A, A))))))), NOR(NOR(NOR(NOR(NOR(NOR(D, NOR(C, C)), NOR(D, NOR(C, C))), NOR(NOR(NOR(B, B), A), NOR(NOR(B, B), A))), NOR(NOR(NOR(D, NOR(C, C)), NOR(D, NOR(C, C))), NOR(NOR(NOR(B, B), NOR(A, A)), NOR(NOR(B, B), NOR(A, A))))), NOR(NOR(NOR(NOR(D, NOR(C, C)), NOR(D, NOR(C, C))), NOR(NOR(NOR(B, B), A), NOR(NOR(B, B), A))), NOR(NOR(NOR(D, NOR(C, C)), NOR(D, NOR(C, C))), NOR(NOR(NOR(B, B), NOR(A, A)), NOR(NOR(B, B), NOR(A, A)))))), NOR(NOR(NOR(NOR(NOR(NOR(D, D), C), NOR(NOR(D, D), C)), NOR(NOR(B, A), NOR(B, A))), NOR(NOR(NOR(NOR(D, D), C), NOR(NOR(D, D), C)), NOR(NOR(B, NOR(A, A)), NOR(B, NOR(A, A))))), NOR(NOR(NOR(NOR(NOR(D, D), C), NOR(NOR(D, D), C)), NOR(NOR(B, A), NOR(B, A))), NOR(NOR(NOR(NOR(D, D), C), NOR(NOR(D, D), C)), NOR(NOR(B, NOR(A, A)), NOR(B, NOR(A, A))))))))

191 compuertas · equivalencia verificada en todas las filas

La misma regla como código

Python
# -*- coding: utf-8 -*-
# Generated by Tangibool (tangibool.python/1). Do not edit by hand; regenerate from the source revision.
# Model: not stated
# Source revision: reference
# Interpretation status: not stated
"""Tangibool evaluator (decision model).

Generated deterministically from the validated Boolean model; it evaluates exactly that
model. It does not establish that the model is a complete, legal, or safe statement of a
real-world rule, and evaluating examples does not verify the rule.

Source revision: reference
Interpretation status: not stated
Exporter: 1.0.0 (format tangibool.python/1; engine 1.0.0; semantics tangibool-semantics/1)
Logic digest: 7eb00dd03ae1ec07d2792c847f4e5db34288ea51c001af5f2977ef79fd88dcb3
Assumptions digest: 25076d78f029a36624a87032d35dc97d625d1c5ab40292fcb6e7c5f036915ed7

Inputs (dict keys, declared order) and generated parameter names:
    'D' -> input_D
    'C' -> input_C
    'B' -> input_B
    'A' -> input_A

Outputs (declared order) and their functions:
    'greater_than_five' -> output_greater_than_five(inputs)

Assumptions (the declared scope, checked by in_scope(inputs)):
    'k1': NOT (D AND (C OR B))

Input contract:
    Every required input must be exactly True or False (type(value) is bool). Missing
    inputs, None, strings, integers (including 0 and 1), and keys that are not declared
    inputs raise InputError before anything is evaluated, including inputs that a
    short-circuiting operator would never read. Results are always bool.

Scope:
    Decision functions raise OutOfScopeError when the inputs violate an assumption; an
    out-of-scope assignment is never turned into a False result. Pass check_scope=False
    to evaluate without the scope check, and use in_scope(inputs) to test it separately.

Usage:

    import tangibool_model as model

    model.evaluate({'D': False, 'C': False, 'B': False, 'A': False})
    # -> {'greater_than_five': False}
    model.output_greater_than_five({'D': False, 'C': False, 'B': False, 'A': False})
    # -> False
    model.evaluate({'D': 1, 'C': False, 'B': False, 'A': False})
    # raises InputError: 1 is an int, not a bool
"""

import collections.abc as _abc
from typing import Dict, Mapping, Tuple

__all__ = [
    "MODEL_INFO",
    "IDENTIFIER_MAP",
    "INPUT_NAMES",
    "OUTPUT_NAMES",
    "ASSUMPTIONS",
    "InputError",
    "OutOfScopeError",
    "minterm_index",
    "in_scope",
    "evaluate",
    "output_greater_than_five",
    "assumption_k1",
]

MODEL_INFO = {
    "format": "tangibool.python/1",
    "mode": "decision",
    "model": None,
    "revision": "reference",
    "interpretation": None,
    "exporter": "1.0.0",
    "engine_version": "1.0.0",
    "semantics_version": "tangibool-semantics/1",
    "logic_digest": "7eb00dd03ae1ec07d2792c847f4e5db34288ea51c001af5f2977ef79fd88dcb3",
    "assumptions_digest": "25076d78f029a36624a87032d35dc97d625d1c5ab40292fcb6e7c5f036915ed7",
    "primary_output": "greater_than_five",
    "unused_inputs": (),
    "subcircuits": (),
}

# Stable ID -> generated identifier (reversible mapping; names are exact, escaped strings).
IDENTIFIER_MAP = {
    "v_095da454e794": {"kind": "input", "name": "D", "identifier": "input_D"},
    "v_18ad16a71134": {"kind": "input", "name": "C", "identifier": "input_C"},
    "v_7fc0ba5488b3": {"kind": "input", "name": "B", "identifier": "input_B"},
    "v_b93ff9520200": {"kind": "input", "name": "A", "identifier": "input_A"},
    "f_2d3893154eb6": {"kind": "output", "name": "greater_than_five", "identifier": "output_greater_than_five"},
    "f_180149c5249a": {"kind": "assumption", "name": "k1", "identifier": "assumption_k1"},
}

INPUT_NAMES = ("D", "C", "B", "A")
OUTPUT_NAMES = ("greater_than_five",)
ASSUMPTIONS = (
    {"name": "k1", "id": "f_180149c5249a", "formula": "NOT (D AND (C OR B))", "description": "The four bits encode a decimal digit 0 to 9 (BCD); codes 10 to 15 never occur."},
)

_DECLARED_INPUTS = frozenset(INPUT_NAMES)
_SCOPE_INPUTS = ("D", "C", "B")
_ASSUMPTION_FORMULAS = {entry["name"]: entry["formula"] for entry in ASSUMPTIONS}


class InputError(ValueError):
    """Raised when inputs are missing, undeclared, or not exactly True/False.

    Every required input must satisfy type(value) is bool. Missing inputs, None, strings,
    integers (including 0 and 1), and keys that are not declared inputs are rejected before
    anything is evaluated. A missing input is never treated as False. The individual problems
    are listed in the problems attribute.
    """

    def __init__(self, problems):
        self.problems = tuple(problems)
        super().__init__("Invalid inputs: " + "; ".join(self.problems))


class OutOfScopeError(ValueError):
    """Raised when the inputs violate the model's assumptions (its declared scope).

    Outside its assumptions the rule has no decision: this error is never a False result.
    The names of the violated assumptions are in the violated attribute.
    """

    def __init__(self, violated):
        self.violated = tuple(violated)
        details = ", ".join(name + " (" + _ASSUMPTION_FORMULAS.get(name, "?") + ")" for name in self.violated)
        super().__init__(
            "Out of scope: the inputs violate "
            + ("assumption " if len(self.violated) == 1 else "assumptions ")
            + details
            + ". The rule has no decision outside its assumptions; this is not a False result."
        )


def _short_repr(value: object) -> str:
    text = repr(value)
    return text if len(text) <= 60 else text[:57] + "..."


def _checked_inputs(inputs: Mapping[str, bool], required: Tuple[str, ...], check_scope: bool) -> Dict[str, bool]:
    """Validate inputs strictly before anything is evaluated and return a plain copy."""
    if type(check_scope) is not bool:
        raise TypeError("check_scope must be True or False")
    if not isinstance(inputs, _abc.Mapping):
        raise InputError(["inputs must be a mapping from input names to True/False, got " + type(inputs).__name__])
    problems = []
    for key in inputs:
        if type(key) is not str or key not in _DECLARED_INPUTS:
            declared = ", ".join(repr(name) for name in INPUT_NAMES) or "none"
            problems.append("undeclared input " + _short_repr(key) + " (declared inputs: " + declared + ")")
    needed = tuple(required) + (_SCOPE_INPUTS if check_scope else ())
    for name in needed:
        if name not in inputs:
            problems.append("missing required input " + repr(name))
    for key, value in inputs.items():
        if type(key) is str and key in _DECLARED_INPUTS and type(value) is not bool:
            problems.append(
                "input " + repr(key) + " must be True or False (type bool), got "
                + type(value).__name__ + " " + _short_repr(value)
            )
    if problems:
        raise InputError(list(dict.fromkeys(problems)))
    return dict(inputs.items())


def _require_bool_args(function: str, pairs: Tuple[Tuple[str, object], ...]) -> None:
    problems = [
        "argument " + repr(name) + " of " + function + " must be True or False (type bool), got "
        + type(value).__name__ + " " + _short_repr(value)
        for name, value in pairs
        if type(value) is not bool
    ]
    if problems:
        raise InputError(problems)


def minterm_index(*values: bool) -> int:
    """Row index of an assignment over a declared variable order.

    The first value is the most significant bit, so all-False is row 0. Used for indexed
    minterm (sum) and maxterm (product) forms.
    """
    index = 0
    for value in values:
        if type(value) is not bool:
            raise InputError(["minterm_index() takes True/False values, got " + type(value).__name__ + " " + _short_repr(value)])
        index = index * 2 + (1 if value else 0)
    return index


def _scope_values(values: Dict[str, bool]) -> Tuple[Tuple[str, bool], ...]:
    """Value of every enabled, confirmed assumption for validated inputs, in declared order."""
    assumption_k1_value = _compute_assumption_k1(values["D"], values["C"], values["B"])
    return (
        ("k1", assumption_k1_value),
    )


def _require_in_scope(values: Dict[str, bool]) -> None:
    violated = tuple(name for name, holds in _scope_values(values) if not holds)
    if violated:
        raise OutOfScopeError(violated)


def in_scope(inputs: Mapping[str, bool]) -> bool:
    """True when the inputs satisfy every assumption (the model's declared scope).

    Requires the inputs the assumptions read; raises InputError for invalid inputs.
    """
    values = _checked_inputs(inputs, (), True)
    return all(holds for _, holds in _scope_values(values))


# ---- Formula bodies (inputs are validated by the public functions below) ----


def _compute_output_greater_than_five(input_D: bool, input_C: bool, input_B: bool, input_A: bool) -> bool:
    """Decision output 'greater_than_five': \u03a3m(D, C, B, A; 6, 7, 8, 9)"""
    return minterm_index(input_D, input_C, input_B, input_A) in (6, 7, 8, 9)


def _compute_assumption_k1(input_D: bool, input_C: bool, input_B: bool) -> bool:
    """Assumption 'k1': NOT (D AND (C OR B))"""
    return not (input_D and (input_C or input_B))


# ---- Public API ----


def output_greater_than_five(inputs: Mapping[str, bool], *, check_scope: bool = True) -> bool:
    """Decision output 'greater_than_five' (stable ID f_2d3893154eb6).

    'greater_than_five' := \u03a3m(D, C, B, A; 6, 7, 8, 9)

    Required inputs: 'D', 'C', 'B', 'A'; with check_scope=True also 'D', 'C', 'B' (read by the assumptions).
    Raises InputError for missing, undeclared, or non-bool inputs, and OutOfScopeError
    when check_scope is True and the inputs violate an assumption.
    """
    values = _checked_inputs(inputs, ("D", "C", "B", "A"), check_scope)
    if check_scope:
        _require_in_scope(values)
    output_greater_than_five_value = _compute_output_greater_than_five(values["D"], values["C"], values["B"], values["A"])
    return output_greater_than_five_value


def evaluate(inputs: Mapping[str, bool], *, check_scope: bool = True) -> Dict[str, bool]:
    """Evaluate every output (declared order); each output is computed once.

    Required inputs: 'D', 'C', 'B', 'A'; with check_scope=True also 'D', 'C', 'B' (read by the assumptions).
    Raises InputError for missing, undeclared, or non-bool inputs, and OutOfScopeError
    when check_scope is True and the inputs violate an assumption.
    """
    values = _checked_inputs(inputs, ("D", "C", "B", "A"), check_scope)
    if check_scope:
        _require_in_scope(values)
    output_greater_than_five_value = _compute_output_greater_than_five(values["D"], values["C"], values["B"], values["A"])
    return {
        "greater_than_five": output_greater_than_five_value,
    }


def assumption_k1(inputs: Mapping[str, bool]) -> bool:
    """Assumption 'k1' (stable ID f_180149c5249a).

    'k1' := NOT (D AND (C OR B))

    Description: The four bits encode a decimal digit 0 to 9 (BCD); codes 10 to 15 never occur.

    Required inputs: 'D', 'C', 'B'.
    Raises InputError for missing, undeclared, or non-bool inputs.
    """
    values = _checked_inputs(inputs, ("D", "C", "B"), False)
    assumption_k1_value = _compute_assumption_k1(values["D"], values["C"], values["B"])
    return assumption_k1_value
PostgreSQL
-- Tangibool PostgreSQL export (tangibool.postgresql/1)
-- Target: PostgreSQL 16 or later with typed boolean inputs; tested with PostgreSQL 18.3 (PGlite 0.5.8).
-- Not a claim of compatibility with other SQL dialects.
-- Model: not stated
-- Source revision: reference
-- Interpretation status: not stated
-- Exporter: 1.0.0 (engine 1.0.0; semantics tangibool-semantics/1)
-- Logic digest: 7eb00dd03ae1ec07d2792c847f4e5db34288ea51c001af5f2977ef79fd88dcb3
-- Assumptions digest: 25076d78f029a36624a87032d35dc97d625d1c5ab40292fcb6e7c5f036915ed7
-- Mode: decision
--
-- Read-only: this file contains only WITH / VALUES / SELECT statements. No DDL, DML,
-- procedures, credentials, network access, or database changes. The expressions are pure
-- Boolean expressions, so their result does not depend on SQL evaluation order.
--
-- NON-NULL INPUT PRECONDITION: NULL is not a truth value of this rule. Every fragment below
-- is defined only when every input column it reads is a non-NULL boolean. The guard template
-- (section 2) marks any NULL input as 'invalid_input' and any row that violates the
-- assumptions as 'out_of_scope', and fills output columns only for 'ok' rows; a NULL in an
-- output column of another row is an envelope marker, not a third truth value. Never wrap
-- the fragments in COALESCE(..., FALSE) or otherwise choose a meaning for unknown inputs.
-- This evaluates the supplied model; it does not show that the model is a complete, legal,
-- or safe statement of a real-world rule.
--
-- Input columns (stable ID: name -> column):
--   v_095da454e794: D -> "in_D"
--   v_18ad16a71134: C -> "in_C"
--   v_7fc0ba5488b3: B -> "in_B"
--   v_b93ff9520200: A -> "in_A"
-- Output columns:
--   f_2d3893154eb6: greater_than_five -> "out_greater_than_five"
-- Assumptions (scope K; exported separately and never folded into an output):
--   f_180149c5249a: k1 -> "assumption_k1": NOT (D AND (C OR B))
--     The four bits encode a decimal digit 0 to 9 (BCD); codes 10 to 15 never occur.

-- ----------------------------------------------------------------------------------------------
-- 1. Expression fragments (parenthesised; non-NULL boolean inputs required)
-- ----------------------------------------------------------------------------------------------
--
-- [out_greater_than_five] output greater_than_five (stable ID f_2d3893154eb6)
--   greater_than_five := \u03a3m(D, C, B, A; 6, 7, 8, 9)
--   PRECONDITION: "in_D", "in_C", "in_B", "in_A" are non-NULL booleans.
--   (((NOT "in_D") AND "in_C" AND "in_B" AND (NOT "in_A")) OR ((NOT "in_D") AND "in_C" AND "in_B" AND "in_A") OR ("in_D" AND (NOT "in_C") AND (NOT "in_B") AND (NOT "in_A")) OR ("in_D" AND (NOT "in_C") AND (NOT "in_B") AND "in_A"))
--
-- [assumption_k1] assumption k1 (stable ID f_180149c5249a)
--   k1 := NOT (D AND (C OR B))
--   PRECONDITION: "in_D", "in_C", "in_B" are non-NULL booleans.
--   (NOT ("in_D" AND ("in_C" OR "in_B")))
--
-- [K] scope (conjunction of the assumptions):
--   (NOT ("in_D" AND ("in_C" OR "in_B")))
--

-- ----------------------------------------------------------------------------------------------
-- 2. Guard template (read-only SELECT over an inputs list)
-- ----------------------------------------------------------------------------------------------
-- Replace the example rows between the markers with your own rows, or replace the inputs
-- CTE with a SELECT that provides the boolean columns listed in the header. status is
-- 'invalid_input' when any input is NULL, 'out_of_scope' when the assumptions are false, and
-- 'ok' otherwise; output columns are filled only for 'ok' rows (NULL elsewhere is an
-- envelope marker). Assumption columns are shown for rows with complete inputs.
WITH inputs ("row_id", "in_D", "in_C", "in_B", "in_A") AS (
  -- tangibool:example-rows:begin
  VALUES
    (1, FALSE, FALSE, FALSE, FALSE),
    (2, FALSE, FALSE, FALSE, TRUE),
    (3, FALSE, FALSE, TRUE, FALSE),
    (4, FALSE, FALSE, TRUE, TRUE),
    (5, FALSE, TRUE, FALSE, FALSE),
    (6, FALSE, TRUE, FALSE, TRUE),
    (7, FALSE, TRUE, TRUE, FALSE),
    (8, FALSE, TRUE, TRUE, TRUE),
    (9, TRUE, FALSE, FALSE, FALSE),
    (10, TRUE, FALSE, FALSE, TRUE),
    (11, TRUE, FALSE, TRUE, FALSE),
    (12, TRUE, FALSE, TRUE, TRUE),
    (13, TRUE, TRUE, FALSE, FALSE),
    (14, TRUE, TRUE, FALSE, TRUE),
    (15, TRUE, TRUE, TRUE, FALSE),
    (16, TRUE, TRUE, TRUE, TRUE),
    (17, NULL::boolean, FALSE, FALSE, FALSE)
  -- tangibool:example-rows:end
),
checked AS (
  SELECT
    inputs.*,
    CASE
      WHEN "in_D" IS NULL OR "in_C" IS NULL OR "in_B" IS NULL OR "in_A" IS NULL THEN 'invalid_input'
      WHEN NOT (NOT ("in_D" AND ("in_C" OR "in_B"))) THEN 'out_of_scope'
      ELSE 'ok'
    END AS "status"
  FROM inputs
)
SELECT
  "row_id",
  "in_D",
  "in_C",
  "in_B",
  "in_A",
  "status",
  CASE WHEN "status" <> 'invalid_input' THEN (NOT ("in_D" AND ("in_C" OR "in_B"))) END AS "assumption_k1",
  CASE WHEN "status" = 'ok' THEN (((NOT "in_D") AND "in_C" AND "in_B" AND (NOT "in_A")) OR ((NOT "in_D") AND "in_C" AND "in_B" AND "in_A") OR ("in_D" AND (NOT "in_C") AND (NOT "in_B") AND (NOT "in_A")) OR ("in_D" AND (NOT "in_C") AND (NOT "in_B") AND "in_A")) END AS "out_greater_than_five"
FROM checked
ORDER BY "row_id";
SMT-LIB
; Tangibool SMT-LIB export (tangibool.smtlib/1)
; Profile: SMT-LIB 2.6 Boolean subset (QF_UF): Bool constants, define-fun, let, push/pop, assert, check-sat, echo.
; Tested with Z3 5.1.0 (z3-solver 5.2.0, WebAssembly build).
; Model: not stated
; Source revision: reference
; Interpretation status: not stated
; Exporter: 1.0.0 (engine 1.0.0; semantics tangibool-semantics/1)
; Logic digest: 7eb00dd03ae1ec07d2792c847f4e5db34288ea51c001af5f2977ef79fd88dcb3
; Assumptions digest: 25076d78f029a36624a87032d35dc97d625d1c5ab40292fcb6e7c5f036915ed7
; Mode: decision
;
; Reading results: each query block states what sat and unsat mean for its question. A sat
; answer comes with a witness or counterexample (ask for it with (get-model) after sat only);
; unsat settles that scoped query and is solver-checked, not an independently checked proof
; certificate; unknown settles nothing. Blocks are scoped with push/pop, so assertions never
; accumulate across questions. This checks the supplied model, not whether it is a complete,
; legal, or safe statement of a real-world rule.
;
; Symbols (stable ID: name -> symbol):
;   v_095da454e794: D -> in_D
;   v_18ad16a71134: C -> in_C
;   v_7fc0ba5488b3: B -> in_B
;   v_b93ff9520200: A -> in_A
;   f_2d3893154eb6: greater_than_five -> out_greater_than_five
;   f_180149c5249a: k1 -> assumption_k1

(set-option :produce-models true)
(set-info :smt-lib-version 2.6)
(set-logic QF_UF)

; ---- Inputs (declared order)
(declare-const in_D Bool) ; D
(declare-const in_C Bool) ; C
(declare-const in_B Bool) ; B
(declare-const in_A Bool) ; A

; ---- Outputs (dependencies first)
; output greater_than_five (stable ID f_2d3893154eb6): \u03a3m(D, C, B, A; 6, 7, 8, 9)
(define-fun out_greater_than_five () Bool (or (and (not in_D) in_C in_B (not in_A)) (and (not in_D) in_C in_B in_A) (and in_D (not in_C) (not in_B) (not in_A)) (and in_D (not in_C) (not in_B) in_A)))

; ---- Assumptions (the scope K; never folded into an output)
; assumption k1 (stable ID f_180149c5249a): NOT (D AND (C OR B))
;   The four bits encode a decimal digit 0 to 9 (BCD); codes 10 to 15 never occur.
(define-fun assumption_k1 () Bool (not (and in_D (or in_C in_B))))
; K: conjunction of the enabled, confirmed assumptions (true when there are none)
(define-fun K () Bool assumption_k1)

; ---- Definitions only: nothing is asserted and no check is run.
; Add (assert ...) and (check-sat) inside (push 1) ... (pop 1) to ask a question.
LaTeX
greater_than_five = \sum m_{(D, C, B, A)}(6, 7, 8, 9)

El error habitual

Olvidar que D por sí solo cubre ocho celdas, seis de las cuales son indiferencias. El grupo parece generoso porque al mapa se le permite usarlas; en la función original D es verdadero solo en las filas 8 y 9. La anotación de alcance del mapa registra que el resultado vale solo dentro del supuesto.

Preguntas

¿Por qué no escribir D OR (C AND B) como fórmula desde el principio?

Porque esa fórmula y la lista de mintérminos discrepan en los códigos 10 a 15, y la comprobación de equivalencia lo diría sin el supuesto. La página parte de la especificación, declara el supuesto explícitamente y deja que el mapa derive la forma corta con una etiqueta que dice dónde es válida.

Relacionado

Herramientas

Véase también

Ejemplos resueltos

Generado a partir del motor de Tangibool, semántica tangibool-semantics/1, motor 1.0.0, compilación . Cada tabla, mapa, simplificación y veredicto de estas páginas lo calculó el motor de Tangibool al compilar el sitio, y cada afirmación la volvió a comprobar el mismo verificador exacto que usa la app. Los límites se indican donde aplican. © 2026 Foreranger LTD.