Reduce 3-SAT instances to colored subgraph isomorphism problems using ThreeMatch gadgets.
npx skills add https://github.com/plurigrid/asi --skill three-match
Please help me install this Agent Skill. Skill: three-match Source: https://github.com/plurigrid/asi/tree/main/skills/three-match Command: npx skills add https://github.com/plurigrid/asi --skill three-match
A GF(3) conservation-based gadget that reduces 3-SAT to colored subgraph isomorphism using non-backtracking geodesics and Möbius filtering.
Run the gadget demo: just three-match
High-intent search queries and answers about installing and using this skill.
Three-match reduces 3-SAT to colored subgraph isomorphism using non-backtracking geodesics and GF(3) conservation. This gadget-based approach enforces local constraints globally, enabling SAT solving through graph matching instead of traditional search.
Non-backtracking geodesics are paths that never immediately reverse direction, eliminating redundant exploration. Three-match uses them to enforce local 3-SAT clause constraints while Möbius filtering cancels invalid path combinations, guaranteeing correct-by-construction solutions.
Yes. Three-match provides a programmable API for constructing ThreeMatch gadgets, validating constraints, and generating correctness-by-construction proofs. GF(3) conservation checks verify that gadget designs satisfy all local-to-global constraint requirements.
GF(3) conservation ensures that gadget values remain consistent across the reduction, preventing invalid satisfying assignments from leaking through. It transforms local clause constraints into global algebraic invariants checkable during subgraph isomorphism matching.
Subgraph isomorphism reduction suits workflows where graph algorithms or specialized hardware outperform SAT solvers, or when you need gadget-level constraint transparency and formal verification of reduction correctness.
Three-match accepts standard 3-SAT clause specifications and generates colored subgraph instances through gadget construction. Run the demo with `just three-match` to see input requirements and output formats in action.
xjtulycDetermine tautologies, contradictions, and valid entailments using Z3 SMT solving.
Snowflake-LabsA concise summary of your roleplay character: name,</name> personality, and/or behavior, formatted as a single string sentence. Typically不超过50字，此处省略
GuitarAlchemistCompute algebraic K-theory invariants K0 and K1 for graph structures.
Arcadi4Audit NP-hardness proofs and polynomial-time reductions for decision problems.
