UOR Resolvers

IRI: https://uor.foundation/resolver/
Prefix: resolver:
Space: bridge
Comment: Type resolution strategies implementing the partition map Π : T_n → Part(R_n). Resolvers transform type declarations into ring partitions.

Imports

Name	IRI	Subclass Of	Comment
Resolver	`https://uor.foundation/resolver/Resolver`	`http://www.w3.org/2002/07/owl#Thing`	A strategy for resolving a type declaration into a partition of the ring. The kernel dispatches to a specific resolver based on the type's structure.
DihedralFactorizationResolver	`https://uor.foundation/resolver/DihedralFactorizationResolver`	`https://uor.foundation/resolver/Resolver`	Resolves types by factoring the ring under dihedral group action. Identifies orbits under D_{2^n} to determine irreducibility boundaries.
CanonicalFormResolver	`https://uor.foundation/resolver/CanonicalFormResolver`	`https://uor.foundation/resolver/Resolver`	Resolves types by computing canonical forms via term rewriting. Applies the critical identity and normalization rules to reduce terms to unique canonical representatives.
EvaluationResolver	`https://uor.foundation/resolver/EvaluationResolver`	`https://uor.foundation/resolver/Resolver`	Resolves types by direct evaluation: applies operations to enumerate ring elements and classify them as irreducible, reducible, unit, or exterior.

Name	Kind	Functional	Domain	Range	Comment
inputType	Object	true	`https://uor.foundation/resolver/Resolver`	`https://uor.foundation/type/TypeDefinition`	The type of input this resolver accepts.
outputType	Object	true	`https://uor.foundation/resolver/Resolver`	`https://uor.foundation/partition/Partition`	The type of output this resolver produces. For all UOR resolvers, the output is a partition:Partition.
strategy	Datatype	true	`https://uor.foundation/resolver/Resolver`	`http://www.w3.org/2001/XMLSchema#string`	A human-readable description of the resolution strategy this resolver implements.
complexity	Datatype	true	`https://uor.foundation/resolver/Resolver`	`http://www.w3.org/2001/XMLSchema#string`	The computational complexity of this resolver, expressed as a big-O string (e.g., 'O(n)', 'O(2^n)').