Formal verification of Romanov's Triplet Logic achieved in Rocq proof assistant

Researchers have formally verified Romanov's Triplet Logic (TLS) using the Rocq proof assistant, marking the first mechanized formalization of this combinatorial framework. The work details the formalization of core TLS components like Compact Triplets Structures (CTS) and Simple Vertex Intersection (SVI), along with a verified translation for the sliding-window fragment of 3-CNF formulas. An OCaml prototype named VFR was extracted, offering a verified decision procedure for this fragment and a sound filter for general 3-CNF, packaged with Python and Docker for reproducibility. AI

IMPACT Formal verification of logic systems can improve the reliability and safety of AI algorithms.

RANK_REASON Academic paper detailing formal verification of a logic system. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

• boolean satisfiability problem
• Compact Triplets Formulas
• Compact Triplets Structures
• Docker
• OCaml
• Python
• Rocq
• Romanov's Effective Procedure
• Romanov's Triplet Logic
• Simple Vertex Intersection
• Zenodo

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →