boolean-algebra-engine 0.1.6__tar.gz → 0.1.7__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/PKG-INFO +20 -2
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/README.md +19 -1
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/boolean_algebra_engine.egg-info/PKG-INFO +20 -2
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/pyproject.toml +1 -1
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/LICENSE +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/api/__init__.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/api/routes.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/boolean_algebra_engine.egg-info/SOURCES.txt +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/boolean_algebra_engine.egg-info/dependency_links.txt +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/boolean_algebra_engine.egg-info/entry_points.txt +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/boolean_algebra_engine.egg-info/requires.txt +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/boolean_algebra_engine.egg-info/top_level.txt +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/cli/__init__.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/cli/main.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/core/__init__.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/core/evaluator.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/core/models.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/core/parser.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/core/synthesizer.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/mcp_server/__init__.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/mcp_server/server.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/nl/__init__.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/nl/nl.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/setup.cfg +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/tests/test_edge_cases.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/tests/test_evaluator.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/tests/test_integration.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/tests/test_models.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/tests/test_parser.py +0 -0
- {boolean_algebra_engine-0.1.6 → boolean_algebra_engine-0.1.7}/tests/test_synthesizer.py +0 -0
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.4
|
|
2
2
|
Name: boolean-algebra-engine
|
|
3
|
-
Version: 0.1.
|
|
3
|
+
Version: 0.1.7
|
|
4
4
|
Summary: Deterministic logic layer for AI agents — catch logical contradictions in system prompts, rules, and agent reasoning
|
|
5
5
|
Author-email: Aditya Shrivastava <aditya.shrivastava.architect@proton.me>
|
|
6
6
|
License-Expression: GPL-3.0-only
|
|
@@ -222,7 +222,7 @@ Both models score 50% — equal to a coin flip — but in opposite directions. t
|
|
|
222
222
|
|
|
223
223
|
The `vars` column shows how many variables each case involves. The `engine` column is ground truth. Every mismatch with `llm` is a provable hallucination — not an opinion.
|
|
224
224
|
|
|
225
|
-

|
|
226
226
|
|
|
227
227
|
Per-case strips (bottom row of the chart): every conflict cell is uniformly one colour per model, every compatible cell is the opposite. No case-by-case variation — no reasoning happening at all.
|
|
228
228
|
|
|
@@ -330,6 +330,24 @@ Variables: uppercase `A`–`Z`. Parentheses override precedence. Up to 26 variab
|
|
|
330
330
|
|
|
331
331
|
---
|
|
332
332
|
|
|
333
|
+
## vs SymPy and boolean.py
|
|
334
|
+
|
|
335
|
+
**SymPy** (`sympy.logic`) is more powerful for pure boolean mathematics — its DPLL-based `satisfiable()` scales better beyond 15 variables, and `simplify_logic()` covers similar minimization ground. If you're doing symbolic mathematics, use SymPy.
|
|
336
|
+
|
|
337
|
+
**boolean.py** handles expression parsing and symbolic simplification cleanly. If you need to manipulate boolean expressions as objects, it's the right tool.
|
|
338
|
+
|
|
339
|
+
**This engine is different in three ways:**
|
|
340
|
+
|
|
341
|
+
1. **Zero-dependency core.** SymPy pulls in numpy, mpmath, and the full symbolic stack. `core/` is plain Python — no install side-effects, embeds anywhere.
|
|
342
|
+
|
|
343
|
+
2. **Built for AI pipelines, not mathematics.** `check_prompt_logic` audits a set of rules for pairwise conflicts — the kind of check you run on a system prompt or a business rule engine before an agent acts on it. Neither SymPy nor boolean.py has this concept.
|
|
344
|
+
|
|
345
|
+
3. **The integration layer.** MCP server for Claude Desktop, NL layer for plain English input, REST API, benchmark against LLMs — none of this exists in math-focused libraries because it's not a math problem. It's an AI reliability problem.
|
|
346
|
+
|
|
347
|
+
If you want to do boolean algebra, SymPy is the answer. If you want to verify that your AI agent's rules don't contradict each other, this is built for that.
|
|
348
|
+
|
|
349
|
+
---
|
|
350
|
+
|
|
333
351
|
## Credibility
|
|
334
352
|
|
|
335
353
|
The engine does not sample, approximate, or predict. It evaluates every possible input combination:
|
|
@@ -175,7 +175,7 @@ Both models score 50% — equal to a coin flip — but in opposite directions. t
|
|
|
175
175
|
|
|
176
176
|
The `vars` column shows how many variables each case involves. The `engine` column is ground truth. Every mismatch with `llm` is a provable hallucination — not an opinion.
|
|
177
177
|
|
|
178
|
-

|
|
179
179
|
|
|
180
180
|
Per-case strips (bottom row of the chart): every conflict cell is uniformly one colour per model, every compatible cell is the opposite. No case-by-case variation — no reasoning happening at all.
|
|
181
181
|
|
|
@@ -283,6 +283,24 @@ Variables: uppercase `A`–`Z`. Parentheses override precedence. Up to 26 variab
|
|
|
283
283
|
|
|
284
284
|
---
|
|
285
285
|
|
|
286
|
+
## vs SymPy and boolean.py
|
|
287
|
+
|
|
288
|
+
**SymPy** (`sympy.logic`) is more powerful for pure boolean mathematics — its DPLL-based `satisfiable()` scales better beyond 15 variables, and `simplify_logic()` covers similar minimization ground. If you're doing symbolic mathematics, use SymPy.
|
|
289
|
+
|
|
290
|
+
**boolean.py** handles expression parsing and symbolic simplification cleanly. If you need to manipulate boolean expressions as objects, it's the right tool.
|
|
291
|
+
|
|
292
|
+
**This engine is different in three ways:**
|
|
293
|
+
|
|
294
|
+
1. **Zero-dependency core.** SymPy pulls in numpy, mpmath, and the full symbolic stack. `core/` is plain Python — no install side-effects, embeds anywhere.
|
|
295
|
+
|
|
296
|
+
2. **Built for AI pipelines, not mathematics.** `check_prompt_logic` audits a set of rules for pairwise conflicts — the kind of check you run on a system prompt or a business rule engine before an agent acts on it. Neither SymPy nor boolean.py has this concept.
|
|
297
|
+
|
|
298
|
+
3. **The integration layer.** MCP server for Claude Desktop, NL layer for plain English input, REST API, benchmark against LLMs — none of this exists in math-focused libraries because it's not a math problem. It's an AI reliability problem.
|
|
299
|
+
|
|
300
|
+
If you want to do boolean algebra, SymPy is the answer. If you want to verify that your AI agent's rules don't contradict each other, this is built for that.
|
|
301
|
+
|
|
302
|
+
---
|
|
303
|
+
|
|
286
304
|
## Credibility
|
|
287
305
|
|
|
288
306
|
The engine does not sample, approximate, or predict. It evaluates every possible input combination:
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.4
|
|
2
2
|
Name: boolean-algebra-engine
|
|
3
|
-
Version: 0.1.
|
|
3
|
+
Version: 0.1.7
|
|
4
4
|
Summary: Deterministic logic layer for AI agents — catch logical contradictions in system prompts, rules, and agent reasoning
|
|
5
5
|
Author-email: Aditya Shrivastava <aditya.shrivastava.architect@proton.me>
|
|
6
6
|
License-Expression: GPL-3.0-only
|
|
@@ -222,7 +222,7 @@ Both models score 50% — equal to a coin flip — but in opposite directions. t
|
|
|
222
222
|
|
|
223
223
|
The `vars` column shows how many variables each case involves. The `engine` column is ground truth. Every mismatch with `llm` is a provable hallucination — not an opinion.
|
|
224
224
|
|
|
225
|
-

|
|
226
226
|
|
|
227
227
|
Per-case strips (bottom row of the chart): every conflict cell is uniformly one colour per model, every compatible cell is the opposite. No case-by-case variation — no reasoning happening at all.
|
|
228
228
|
|
|
@@ -330,6 +330,24 @@ Variables: uppercase `A`–`Z`. Parentheses override precedence. Up to 26 variab
|
|
|
330
330
|
|
|
331
331
|
---
|
|
332
332
|
|
|
333
|
+
## vs SymPy and boolean.py
|
|
334
|
+
|
|
335
|
+
**SymPy** (`sympy.logic`) is more powerful for pure boolean mathematics — its DPLL-based `satisfiable()` scales better beyond 15 variables, and `simplify_logic()` covers similar minimization ground. If you're doing symbolic mathematics, use SymPy.
|
|
336
|
+
|
|
337
|
+
**boolean.py** handles expression parsing and symbolic simplification cleanly. If you need to manipulate boolean expressions as objects, it's the right tool.
|
|
338
|
+
|
|
339
|
+
**This engine is different in three ways:**
|
|
340
|
+
|
|
341
|
+
1. **Zero-dependency core.** SymPy pulls in numpy, mpmath, and the full symbolic stack. `core/` is plain Python — no install side-effects, embeds anywhere.
|
|
342
|
+
|
|
343
|
+
2. **Built for AI pipelines, not mathematics.** `check_prompt_logic` audits a set of rules for pairwise conflicts — the kind of check you run on a system prompt or a business rule engine before an agent acts on it. Neither SymPy nor boolean.py has this concept.
|
|
344
|
+
|
|
345
|
+
3. **The integration layer.** MCP server for Claude Desktop, NL layer for plain English input, REST API, benchmark against LLMs — none of this exists in math-focused libraries because it's not a math problem. It's an AI reliability problem.
|
|
346
|
+
|
|
347
|
+
If you want to do boolean algebra, SymPy is the answer. If you want to verify that your AI agent's rules don't contradict each other, this is built for that.
|
|
348
|
+
|
|
349
|
+
---
|
|
350
|
+
|
|
333
351
|
## Credibility
|
|
334
352
|
|
|
335
353
|
The engine does not sample, approximate, or predict. It evaluates every possible input combination:
|
|
@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
|
|
|
4
4
|
|
|
5
5
|
[project]
|
|
6
6
|
name = "boolean-algebra-engine"
|
|
7
|
-
version = "0.1.
|
|
7
|
+
version = "0.1.7"
|
|
8
8
|
description = "Deterministic logic layer for AI agents — catch logical contradictions in system prompts, rules, and agent reasoning"
|
|
9
9
|
readme = "README.md"
|
|
10
10
|
license = "GPL-3.0-only"
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|