Datenvertragswerk
formal context implication basis
Constructs the Duquenne-Guigues canonical implication basis from a finite binary object-attribute context with attribute_count 0..4 and 0..8 Boolean incidence rows. Returns every rule P -> P-double-prime minus P for the pseudo-intents P, ordered by numeric premise mask (bit i names attribute i), and the exact double-derivation closure of every attribute subset as closure_table indexed by numeric subset mask. The basis is sound, complete and irredundant.
POST https://datenvertrag.halowerk.com/v1/formal-context-implication-basisInputs
| Field | Type | Required | Description |
|---|---|---|---|
| attribute_count | integer | Yes | |
| incidence | See schema | Yes | |
| claim_basis | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"attribute_count": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"incidence": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "boolean"
},
"maxItems": 4
},
"maxItems": 8
},
{
"type": "null"
}
]
},
"claim_basis": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"properties": {
"premise": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"maxItems": 4,
"uniqueItems": true
},
"conclusion": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"maxItems": 4,
"uniqueItems": true
}
},
"required": [
"premise",
"conclusion"
],
"additionalProperties": false
},
"maxItems": 16
},
{
"type": "null"
}
]
}
},
"required": [
"attribute_count",
"incidence",
"claim_basis"
],
"additionalProperties": false
}Published input example
{
"attribute_count": 0,
"incidence": [],
"claim_basis": []
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.