HALOWERKDatenvertragswerk
binary constraint arc closure audit
Own bounded greatest arcconsistent closure on <=6discretevariables/domains<=6values with one explicitly supplied binaryrelation per unorderedpair. Output every remaining/removedvalue and leastsupport witness per directedarc/value; compare whole domainclaim assetvectors. Emptydomain proves unsatisfiable; NONEMPTYclosure explicitly satisfiability=not_decided, never SATproof. Missing domain/relation prevents fullclosure, knowninitialempty stillunsat. No CSPsolver/library/program execution..
POST https://datenvertrag.halowerk.com/v1/binary-constraint-arc-closure-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed_domains | Siehe Schema | Ja | |
| domains | array | Ja | |
| relations | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed_domains": {
"anyOf": [
{
"items": {
"items": {
"maximum": 5,
"minimum": 0,
"type": "integer"
},
"maxItems": 6,
"type": "array",
"uniqueItems": true
},
"maxItems": 6,
"type": "array"
},
{
"type": "null"
}
]
},
"domains": {
"items": {
"anyOf": [
{
"items": {
"maximum": 5,
"minimum": 0,
"type": "integer"
},
"maxItems": 6,
"type": "array",
"uniqueItems": true
},
{
"type": "null"
}
]
},
"maxItems": 6,
"minItems": 1,
"type": "array"
},
"relations": {
"items": {
"anyOf": [
{
"additionalProperties": false,
"properties": {
"allowed": {
"items": {
"items": {
"maximum": 5,
"minimum": 0,
"type": "integer"
},
"maxItems": 2,
"minItems": 2,
"type": "array"
},
"maxItems": 36,
"type": "array",
"uniqueItems": true
},
"u": {
"maximum": 5,
"minimum": 0,
"type": "integer"
},
"v": {
"maximum": 5,
"minimum": 0,
"type": "integer"
}
},
"required": [
"u",
"v",
"allowed"
],
"type": "object"
},
{
"type": "null"
}
]
},
"maxItems": 15,
"type": "array"
}
},
"required": [
"domains",
"relations",
"claimed_domains"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed_domains": [
[
0
],
[
0
],
[
0
]
],
"domains": [
[
0
],
[
0,
1
],
[
0,
1
]
],
"relations": [
{
"allowed": [
[
0,
0
],
[
1,
1
]
],
"u": 0,
"v": 1
},
{
"allowed": [
[
0,
0
],
[
1,
1
]
],
"u": 1,
"v": 2
}
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- 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.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden