boolean-algebra-engine 0.1.3__tar.gz → 0.1.4__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.3 → boolean_algebra_engine-0.1.4}/PKG-INFO +5 -5
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/README.md +4 -4
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/boolean_algebra_engine.egg-info/PKG-INFO +5 -5
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/pyproject.toml +1 -1
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/LICENSE +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/api/__init__.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/api/routes.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/boolean_algebra_engine.egg-info/SOURCES.txt +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/boolean_algebra_engine.egg-info/dependency_links.txt +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/boolean_algebra_engine.egg-info/entry_points.txt +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/boolean_algebra_engine.egg-info/requires.txt +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/boolean_algebra_engine.egg-info/top_level.txt +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/cli/__init__.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/cli/main.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/core/__init__.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/core/evaluator.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/core/models.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/core/parser.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/core/synthesizer.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/mcp_server/__init__.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/mcp_server/server.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/nl/__init__.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/nl/nl.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/setup.cfg +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/tests/test_edge_cases.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/tests/test_evaluator.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/tests/test_integration.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/tests/test_models.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/tests/test_parser.py +0 -0
- {boolean_algebra_engine-0.1.3 → boolean_algebra_engine-0.1.4}/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.4
|
|
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
|
|
@@ -89,7 +89,7 @@ Nobody caught these by reading the rules. The engine caught them by checking eve
|
|
|
89
89
|
|
|
90
90
|
## The benchmark
|
|
91
91
|
|
|
92
|
-

|
|
92
|
+

|
|
93
93
|
|
|
94
94
|
The engine is the oracle — ground truth is computed by exhaustive enumeration, not guessed by a human labeler.
|
|
95
95
|
|
|
@@ -97,7 +97,7 @@ The engine is the oracle — ground truth is computed by exhaustive enumeration,
|
|
|
97
97
|
|
|
98
98
|
The methodology: generate rule sets where the correct logical answer is known (computed by the engine), ask an LLM the same question, compare. Every disagreement is a provable hallucination. No ambiguity. No interpretation.
|
|
99
99
|
|
|
100
|
-

|
|
100
|
+

|
|
101
101
|
|
|
102
102
|
Full benchmark across models is in progress. See `BENCHMARK_PLAN.md`.
|
|
103
103
|
|
|
@@ -228,7 +228,7 @@ Five tools Claude can call mid-conversation:
|
|
|
228
228
|
|
|
229
229
|
## Visualisations
|
|
230
230
|
|
|
231
|
-

|
|
231
|
+

|
|
232
232
|
|
|
233
233
|
The Streamlit UI generates two classes of charts automatically from engine output:
|
|
234
234
|
|
|
@@ -236,7 +236,7 @@ The Streamlit UI generates two classes of charts automatically from engine outpu
|
|
|
236
236
|
|
|
237
237
|
**Conflict matrix** — N×N grid, one cell per rule pair. Red `✗` means always conflict. Green `✓` means no overlap. Yellow `≡` means duplicate rule. Three red cells in a matrix of 6 rules is immediately visible before the user finishes scrolling.
|
|
238
238
|
|
|
239
|
-

|
|
239
|
+

|
|
240
240
|
|
|
241
241
|
---
|
|
242
242
|
|
|
@@ -43,7 +43,7 @@ Nobody caught these by reading the rules. The engine caught them by checking eve
|
|
|
43
43
|
|
|
44
44
|
## The benchmark
|
|
45
45
|
|
|
46
|
-

|
|
46
|
+

|
|
47
47
|
|
|
48
48
|
The engine is the oracle — ground truth is computed by exhaustive enumeration, not guessed by a human labeler.
|
|
49
49
|
|
|
@@ -51,7 +51,7 @@ The engine is the oracle — ground truth is computed by exhaustive enumeration,
|
|
|
51
51
|
|
|
52
52
|
The methodology: generate rule sets where the correct logical answer is known (computed by the engine), ask an LLM the same question, compare. Every disagreement is a provable hallucination. No ambiguity. No interpretation.
|
|
53
53
|
|
|
54
|
-

|
|
54
|
+

|
|
55
55
|
|
|
56
56
|
Full benchmark across models is in progress. See `BENCHMARK_PLAN.md`.
|
|
57
57
|
|
|
@@ -182,7 +182,7 @@ Five tools Claude can call mid-conversation:
|
|
|
182
182
|
|
|
183
183
|
## Visualisations
|
|
184
184
|
|
|
185
|
-

|
|
185
|
+

|
|
186
186
|
|
|
187
187
|
The Streamlit UI generates two classes of charts automatically from engine output:
|
|
188
188
|
|
|
@@ -190,7 +190,7 @@ The Streamlit UI generates two classes of charts automatically from engine outpu
|
|
|
190
190
|
|
|
191
191
|
**Conflict matrix** — N×N grid, one cell per rule pair. Red `✗` means always conflict. Green `✓` means no overlap. Yellow `≡` means duplicate rule. Three red cells in a matrix of 6 rules is immediately visible before the user finishes scrolling.
|
|
192
192
|
|
|
193
|
-

|
|
193
|
+

|
|
194
194
|
|
|
195
195
|
---
|
|
196
196
|
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.4
|
|
2
2
|
Name: boolean-algebra-engine
|
|
3
|
-
Version: 0.1.
|
|
3
|
+
Version: 0.1.4
|
|
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
|
|
@@ -89,7 +89,7 @@ Nobody caught these by reading the rules. The engine caught them by checking eve
|
|
|
89
89
|
|
|
90
90
|
## The benchmark
|
|
91
91
|
|
|
92
|
-

|
|
92
|
+

|
|
93
93
|
|
|
94
94
|
The engine is the oracle — ground truth is computed by exhaustive enumeration, not guessed by a human labeler.
|
|
95
95
|
|
|
@@ -97,7 +97,7 @@ The engine is the oracle — ground truth is computed by exhaustive enumeration,
|
|
|
97
97
|
|
|
98
98
|
The methodology: generate rule sets where the correct logical answer is known (computed by the engine), ask an LLM the same question, compare. Every disagreement is a provable hallucination. No ambiguity. No interpretation.
|
|
99
99
|
|
|
100
|
-

|
|
100
|
+

|
|
101
101
|
|
|
102
102
|
Full benchmark across models is in progress. See `BENCHMARK_PLAN.md`.
|
|
103
103
|
|
|
@@ -228,7 +228,7 @@ Five tools Claude can call mid-conversation:
|
|
|
228
228
|
|
|
229
229
|
## Visualisations
|
|
230
230
|
|
|
231
|
-

|
|
231
|
+

|
|
232
232
|
|
|
233
233
|
The Streamlit UI generates two classes of charts automatically from engine output:
|
|
234
234
|
|
|
@@ -236,7 +236,7 @@ The Streamlit UI generates two classes of charts automatically from engine outpu
|
|
|
236
236
|
|
|
237
237
|
**Conflict matrix** — N×N grid, one cell per rule pair. Red `✗` means always conflict. Green `✓` means no overlap. Yellow `≡` means duplicate rule. Three red cells in a matrix of 6 rules is immediately visible before the user finishes scrolling.
|
|
238
238
|
|
|
239
|
-

|
|
239
|
+

|
|
240
240
|
|
|
241
241
|
---
|
|
242
242
|
|
|
@@ -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.4"
|
|
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
|