{"id":"io.github.marcoret74/semantic-geometry","slug":"io-github-marcoret74-semantic-geometry","title":"Semantic Geometry","description":"Deterministic verifier: LLM proposes, graph verifies. Sub-ms, offline, 0 tokens.","version":"1.0.0","publisher":{"kind":"github","id":"marcoret74","label":"@marcoret74 on GitHub","url":"https://github.com/marcoret74"},"website":"https://semgeo.cl","repository":"https://github.com/marcoret74/sg","remotes":[{"type":"streamable-http","url":"https://verify.semgeo.cl/mcp"}],"packages":[],"published":"2026-10-16","updated":"2026-10-16","status":"online","auth":"","latency_ms":2045,"checked":"2026-11-19","uptime":100,"checks":3,"tools":[{"name":"sg_help","title":"Ayuda / Help","description":"EN: Show usage, available tools and the latency contract. Optional lang=es|en and topic=tool_name. | ES: Muestra ayuda, herramientas disponibles y el contrato de latencia. Opcional lang=es|en y topic=nombre_de_tool.","read_only":true},{"name":"sg_calculate_math","title":"Calcular matemática exacta","description":"EN: Evaluate math/physics expressions deterministically (C++23, IEEE 754 double, exact): '2^8', 'x+5=12'. | ES: Evalúa expresiones matemáticas, aritméticas, algebraicas o ecuaciones de física deterministamente en C++23 con precisión IEEE 754 de 64 bits (ej: '1 + 1', '25 * 4', '2^8', 'x + 5 = 12').","read_only":true},{"name":"sg_explain","title":"Explicar veredicto","description":"EN: Explain a claim: verdict, evidence path, alternatives and a concise why. Use it after sg_verify_claim when an LLM needs to justify the result. | ES: Explica una afirmación: veredicto, camino de evidencia, alternativas y un porqué conciso. Úsalo después de sg_verify_claim cuando un LLM necesite justificar el resultado.","read_only":true},{"name":"sg_ask","title":"Preguntar a SG","description":"EN: Ask SG a natural-language question using its cognitive router and semantic graph. Returns the engine answer and latency; cite it, do not invent. | ES: Pregunta a SG en lenguaje natural usando su router cognitivo y grafo semántico. Devuelve la respuesta del motor y la latencia; cítala, no la inventes.","read_only":true},{"name":"sg_quantity","title":"Pregunta cuantitativa DOC1","description":"EN: Answer a curated quantitative question via the DOC1 QUANTITY_LOOKUP plan. Returns verdict, answer, document and sources. It does not count graph edges and never invents a number: without a curated attribute + source it returns NO_EVIDENCE. Supports multi-source conflict (CONFLICT), wrong-agent refutation (REFUTED) and unknown entity (NODE_ABSENT). Examples: 'how many clean animals entered Noah","read_only":true},{"name":"sg_plan","title":"Planificador determinista","description":"EN: Solve a deterministic finite-state planning task. Actions are data: name, preconditions, not_preconditions, effects, cost. objective=steps returns the shortest plan; objective=cost returns the cheapest plan. Bounded by max_depth/max_nodes. | ES: Resuelve una tarea de planificación determinista de estados finitos. Las acciones son datos: nombre, precondiciones, not_preconditions, efectos, costo","read_only":true},{"name":"sg_plan_uncertain","title":"Planificador probabilístico","description":"EN: Finite-horizon probabilistic planning. Actions may declare outcomes [{probability, effects}]; returns the policy maximizing goal probability. | ES: Planificación probabilística de horizonte finito. Las acciones pueden declarar outcomes [{probability, effects}]; devuelve la política que maximiza la probabilidad de alcanzar el goal.","read_only":true},{"name":"sg_causal","title":"Causalidad gráfica / do(X)","description":"EN: Analyze an explicit DAG for causal identification: parents, descendants, backdoor paths, minimal adjustment sets and do(X) graph. Graphical only; it does not estimate effect sizes. | ES: Analiza un DAG explícito para identificación causal: padres, descendientes, caminos traseros, conjuntos de ajuste mínimos y grafo do(X). Solo gráfico; NO estima el tamaño del efecto.","read_only":true},{"name":"sg_frontdoor","title":"Front-door de Pearl","description":"EN: Pearl front-door criterion on a declared ADMG. Directed edges {from,to} and bidirected edges {from,to,bidirected:true} (latent confounder). Returns identifiable_by_front_door, minimal mediator sets and the structural formula. It does not estimate effect sizes. | ES: Criterio front-door de Pearl sobre un ADMG declarado. Aristas dirigidas {from,to} y bidirected {from,to,bidirected:true} (confuso","read_only":true},{"name":"sg_analogy","title":"Analogías proporcionales A:B::C:D","description":"EN: Proportional analogy A : B :: C : ? with role isomorphism from the graph and geometric ranking in the cube. Deterministic, no LLM; returns CONFIRMED / NO_EVIDENCE / NODE_ABSENT plus candidates. | ES: Analogía proporcional A : B :: C : ? con isomorfismo de rol del grafo y ranking geométrico en el cubo. Determinista, sin LLM; devuelve CONFIRMED / NO_EVIDENCE / NODE_ABSENT más candidatos.","read_only":true},{"name":"sg_abduction","title":"Diagnóstico abductivo de causa raíz","description":"EN: Abductive root-cause diagnosis over a declared discrete SCM. Given evidence, enumerates compatible exogenous worlds and returns the most probable root-cause combination with verdicts DIAGNOSED / INCONCLUSIVE / INCONSISTENT / NODE_ABSENT / MODEL_INVALID, margin and entropy. It does not invent mechanisms. | ES: Diagnóstico abductivo de causa raíz sobre un SCM discreto declarado. Dada la evidenci","read_only":true},{"name":"sg_scm","title":"SCM discreto / do(X)","description":"EN: Evaluate a discrete deterministic structural causal model (SCM): observational vs do(X=x) distributions by exact enumeration. Mechanisms are lookup tables, no eval. | ES: Evalúa un modelo causal estructural (SCM) discreto y determinista: distribución observacional vs do(X=x) por enumeración exacta. Los mecanismos son tablas, sin eval.","read_only":true},{"name":"sg_causal_effect","title":"Efecto causal por backdoor","description":"EN: Estimate P(Y|do(X=x)) from discrete observational data using an explicit DAG and backdoor adjustment. Requires positivity; reports partial identification. | ES: Estima P(Y|do(X=x)) desde datos observacionales discretos usando un DAG explícito y ajuste por backdoor. Requiere positividad; reporta identificación parcial.","read_only":true},{"name":"sg_scm_learn","title":"SCM aprendido de datos","description":"EN: Learn a fully observed discrete SCM from data (empirical CPTs) and simulate observational vs do(X=x) distributions by ancestral sampling. | ES: Aprende un SCM discreto totalmente observado desde datos (CPTs empíricas) y simula distribuciones observacional vs do(X=x) por muestreo ancestral.","read_only":true},{"name":"sg_solve","title":"Agente multi-paso","description":"EN: Deterministic multi-step agent: ask/verify a claim, explain the verdict and optionally plan. Each step is evidence-backed; no invented conclusions. | ES: Agente multi-paso determinista: pregunta/verifica un claim, explica el veredicto y opcionalmente planifica. Cada paso queda respaldado por evidencia; no inventa conclusiones.","read_only":true},{"name":"sg_domain","title":"Pack de dominio","description":"EN: Return a data-driven domain pack: frame, tools, cues, slots, examples and safety limits. Domains: legal, mineria, agro, robotica, cmf, cpp. | ES: Devuelve un pack de dominio data-driven: frame, tools, pistas, slots, ejemplos y límites de seguridad. Dominios: legal, mineria, agro, robotica, cmf, cpp.","read_only":true},{"name":"sg_plan_pddl","title":"Planificador PDDL STRIPS","description":"EN: Plan a STRIPS PDDL domain + problem (predicates, actions, objects, init, goal). Returns the shortest/cheapest grounded plan. | ES: Planifica un dominio + problema PDDL STRIPS (predicados, acciones, objetos, init, goal). Devuelve el plan ground más corto/barato.","read_only":true},{"name":"sg_causal_discover","title":"Descubrir estructura causal","description":"EN: Discover a discrete causal skeleton from observational data (PC + unshielded colliders). Assumes causal sufficiency/faithfulness; does not discover latent confounders. | ES: Descubre un esqueleto causal discreto desde datos observacionales (PC + colisionadores no shieldados). Asume suficiencia causal/faithfulness; no descubre confounders latentes.","read_only":true},{"name":"sg_causal_uncertainty","title":"Incertidumbre causal bootstrap","description":"EN: Bootstrap confidence intervals for P(Y|do(X=x)) under backdoor adjustment. Reports positivity and refuses partial identification. | ES: Intervalos bootstrap de confianza para P(Y|do(X=x)) con ajuste backdoor. Reporta positividad y rechaza identificación parcial.","read_only":true},{"name":"sg_world_model","title":"World model discreto","description":"EN: Learn a discrete world model from (state, action, next_state) rows, predict the next-state distribution, or plan a finite-horizon policy. | ES: Aprende un world model discreto desde filas (state, action, next_state), predice la distribución del siguiente estado o planifica una política de horizonte finito.","read_only":true},{"name":"sg_swarm","title":"Enjambre multiagente","description":"EN: Deterministic agent swarm: explorer, parallel verifiers, critic and optional planner. No LLM or probabilistic consensus at runtime. | ES: Enjambre determinista de agentes: explorador, verificadores en paralelo, crítico y planner opcional. Sin LLM ni consenso probabilístico en runtime.","read_only":true},{"name":"sg_counterfactual","title":"Razonamiento contrafactual","description":"EN: Counterfactual reasoning on a discrete SCM: abduct exogenous worlds compatible with evidence, apply do(...), and predict a query variable. | ES: Razonamiento contrafactual sobre un SCM discreto: abduce mundos exógenos compatibles con la evidencia, aplica do(...) y predice una variable query.","read_only":true},{"name":"sg_diagnose","title":"Diagnóstico abductivo","description":"EN: Abductive diagnosis on a discrete SCM: given evidence, rank declared causes by posterior probability over compatible exogenous worlds. | ES: Diagnóstico abductivo sobre un SCM discreto: dada la evidencia, rankea las causas declaradas por probabilidad posterior en los mundos exógenos compatibles.","read_only":true},{"name":"sg_timeline","title":"Razonamiento temporal Allen","description":"EN: Temporal reasoning with Allen interval algebra. Two modes: explicit events [{id,start,end}] or real validity intervals from semantic.db (concepts, e.g. 'ley 19.886'), optionally evaluating a date `at`. Returns before/meets/overlaps/during/contains/etc. | ES: Razonamiento temporal con álgebra de intervalos de Allen. Dos modos: eventos explícitos [{id,start,end}] o vigencias reales de semantic.d","read_only":true},{"name":"sg_deontic","title":"Lógica deóntica O/P/F","description":"EN: Deterministic deontic logic (O/P/F). Given norms with conditions, exceptions (unless), priority and specificity, derives each action's status (OBLIGATORY/FORBIDDEN/PERMITTED/OPTIONAL/CONFLICT) and explains conflicts and their resolution. | ES: Lógica deóntica determinista (O/P/F). Dadas normas con condiciones, excepciones (unless), prioridad y especificidad, deriva el estado de cada acción (OB","read_only":true},{"name":"sg_modal","title":"Lógica modal Kripke □/◇","description":"EN: Propositional modal logic over a Kripke frame. Evaluates formulas with box [] (necessity) and diamond <> (possibility) at one world or all worlds, and classifies frame properties (serial/reflexive/symmetric/transitive/euclidean) into K/D/T/B/S4/S5. | ES: Lógica modal proposicional sobre un marco de Kripke. Evalúa fórmulas con caja [] (necesidad) y diamante <> (posibilidad) en un mundo o en tod","read_only":true},{"name":"sg_verify_claim","title":"Verificar afirmación ontológica","description":"EN: Verify a factual/ontological claim against the semantic graph. Returns CONFIRMED (direct edge), CONFIRMED_BY_PATH (multi-hop), NO_EVIDENCE (graph has no evidence — NOT false), NODE_ABSENT (term outside the cube), REFUTED (direct refutation), CONFIRMED_NEGATIVE, CONFLICT (derogated norm used as valid). Direct-edge checks are ~ms; BFS/NO_EVIDENCE can take longer. The response includes a `calibra","read_only":true},{"name":"sg_thread_radiography","title":"Radiografía de hilo conversacional","description":"EN: Build a stateless conversation-thread radiography from the last N turns: frame, entities, slots, per-entity open questions, heading/affect, frame geometry, potential field/attractors, controlled potential tie-break and evidence. Optional entity lookup. No persistence. | ES: Construye una radiografía stateless de un hilo (últimos N turnos): frame, entidades, slots, preguntas abiertas por entida","read_only":true},{"name":"sg_lookup_concept","title":"Consultar concepto en el cubo","description":"EN: Look up a concept in the semantic cube [-1,1]^3: coordinates (Valence, Energy, Certainty), octant and clean causal relations. | ES: Busca un concepto en el hipercubo semántico [-1, 1]³ y retorna sus coordenadas tridimensionales (Valencia, Energía, Certeza), octante y relaciones ontológicas causales limpias.","read_only":true},{"name":"sg_semantic_centroid","title":"Centroide semántico","description":"EN: Compute the continuous 3D semantic centroid, scalar variance and covariance matrix of a phrase/query. | ES: Calcula el centroide semántico continuo 3D, la varianza escalar y la matriz de covarianza de una frase o consulta en formato limpio.","read_only":true},{"name":"sg_brujula","title":"Brújula semántica","description":"EN: Semantic compass: polar decomposition of a concept in the cube — radius r, mass M=r², heading θ and octant. | ES: Brújula Semántica: descompone un concepto en su forma polar en el hipercubo [-1,1]³ — radio (r), masa (M=r²), heading (ángulo θ) y octante. La masa mide la energía semántica; el heading el eje (ontológico/biográfico).","read_only":true},{"name":"sg_resonancia","title":"Resonancia polar","description":"EN: Polar resonance between TWO concepts: angular affinity (1+cos Δθ)/2, radial ratio and coupling, plus 3D Euclidean distance. | ES: Resonancia polar entre DOS conceptos: afinidad angular (1+cos Δθ)/2, ratio radial (tensión de magnitud) y el acople (afinidad × ratio), junto a la distancia euclidiana 3D como referencia. Lente armónica del circunplex de Russell, complementaria a la distancia.","read_only":true},{"name":"sg_resonantes","title":"Conceptos resonantes","description":"EN: Concepts that RESONATE with a given one: polar re-ranking of cube neighbors by angular affinity and radial magnitude (finds translations and related concepts). | ES: Conceptos que RESUENAN con uno dado: re-ranking polar de los vecinos del hipercubo por afinidad angular y magnitud radial. Surte equivalencias semánticas (traducciones en la misma posición, resonancia ~1.0) y conceptos afines.","read_only":true},{"name":"sg_reverse_gps","title":"GPS inverso offline","description":"EN: Reverse geocoding: exact street address (street, number, commune) and map links from latitude/longitude (100% offline). | ES: Obtiene la dirección catastral exacta (calle, número y comuna) y enlaces a mapas a partir de coordenadas GPS de latitud y longitud (100% offline, 0 mm error).","read_only":true},{"name":"sg_geocode_address","title":"Geocodificar dirección","description":"EN: Geocode an address/street/commune to WGS84 coordinates and navigation links (100% offline). | ES: Geocodifica una dirección o nombre de calle/comuna a coordenadas GPS WGS84 de alta precisión y enlaces de navegación satelital (100% offline).","read_only":true},{"name":"sg_solar_system_snapshot","title":"Efemérides solares","description":"EN: Compute J2000 orbital ephemerides, lunar phases and Solar System coordinates deterministically. | ES: Calcula efemérides orbitales J2000, fases lunares y coordenadas del Sistema Solar en tiempo real de forma 100% determinista.","read_only":true},{"name":"sg_mining_simulation","title":"Simulación minera","description":"EN: Run a critical ventilation/geomechanics incident simulation in an underground mine (El Teniente / Chuquicamata). | ES: Ejecuta simulación de incidente crítico de ventilación y geomecánica en faena subterránea (Codelco El Teniente / Chuquicamata).","read_only":true},{"name":"sg_eval_rules","title":"Evaluar reglas DSL","description":"EN: Run a CLOSED-domain SG DSL program (facts + rules, EXACT arithmetic) and return derived facts with their inference chain. Deterministic, offline, sub-ms. Not a general-purpose language. | ES: Ejecuta un programa del DSL CERRADO de dominio de SG (hechos + reglas, con aritmética EXACTA) y devuelve los hechos DERIVADOS con su cadena de inferencia. Determinista, offline, sub-ms. Útil para protocol","read_only":true},{"name":"sg_sgdsl_eval","title":"sg_sgdsl_eval","description":"EN: Evaluate an SGDSL 2.0 program (typed Datalog, aggregates, stratified negation, builtins). Returns facts, queries, constraints, optional trace and per-fact proof (`explain`). Deterministic, offline; `path` requires SGDSL_ALLOWED_ROOT. | ES: Evalúa un programa SGDSL 2.0 (Datalog tipado, agregados, negación estratificada, builtins). Devuelve hechos, queries, constraints, traza opcional y árbol de","read_only":true},{"name":"sg_dimension_check","title":"Verificar consistencia dimensional","description":"Verifica si una ecuación es dimensionalmente consistente usando SG-DOC C++23. Acepta 'P = V * I', 'E = mc²', '1/2mv²' o un id de fórmula. Devuelve CONFIRMED (dimensiones iguales), REFUTED (no coinciden) o NO_EVIDENCE (símbolo/fórmula desconocida). No es calculator aritmética: solo dimensiones.","read_only":true},{"name":"sg_dimension_derive","title":"Derivar magnitudes","description":"Dado un nombre de magnitud (ej. 'potencia', 'energia', 'resistencia') o un id de fórmula, devuelve las fórmulas que la derivan, variables, dimensiones y veredicto. No es un solver simbólico general.","read_only":true},{"name":"sg_dimension_proof","title":"Demostración formal SG-DOC","description":"Devuelve la demostración auditada de una fórmula del catálogo: pasos, fuente, dimensiones LHS/RHS y veredicto. Si la fórmula no existe o no tiene pasos/fuente, devuelve NO_EVIDENCE. No inventa pasos.","read_only":true},{"name":"sg_math_eval","title":"Evaluar expresión","description":"Evalúa una expresión aritmética/científica con el motor C++23 (IEEE 754).","read_only":true},{"name":"sg_math_eval_units","title":"Evaluar con unidades","description":"Evalúa expresiones con unidades SI y convierte a base: '9.8 m/s^2 * 2 s', '1 km + 500 m'.","read_only":true},{"name":"sg_math_solve","title":"Resolver ecuación","description":"Resuelve ecuaciones lineales y cuadráticas en x/y con el solver C++23.","read_only":true},{"name":"sg_math_convert","title":"Convertir unidades","description":"Convierte una expresión a otra unidad compatible: '1 km' → 'm', '1 m/s' → 'km/h'.","read_only":true},{"name":"sg_math_isolate","title":"Despejar variable de fórmula","description":"Despeja una variable de una fórmula del catálogo: potencia_electrica + I → P / V.","read_only":true},{"name":"sg_math_catalog","title":"Catálogo SG-DOC","description":"Lista magnitudes y fórmulas canónicas del catálogo SG-DOC. Permite filtrar por texto (id/fórmula/fuente) y limitar resultados. Útil para descubrir qué fórmulas se pueden verificar o demostrar.","read_only":true}],"server_info":{"name":"semantic-geometry-mcp","version":"5.2.0"},"category":"memory","tags":["agents","crypto","travel"],"kind":"remote","source":"registry","submitted":{},"first_party":false,"domain_rank":null,"score":100,"indexable":true,"first_seen":"2026-10-16","stars":0,"badges":[],"sponsor":null,"page":"https://agentsindex.org/agents/io-github-marcoret74-semantic-geometry/"}