[KongchangAI]
Conceptk-合取范式

k-CNF

A standard form of propositional logic formulas consisting of a conjunction of clauses, where each clause is a disjunction of at most k literals. It is commonly used as an intermediate representation in formal verification.

Timeline (last 90 days)

Oct 28

SharpLogic is an open-source project that encodes multi-agent routing and retries as k-CNF and uses a Rust kernel to count the number of deadlock and failure paths (#F counting), for use as a pre-release gate check.

Unverified50%
Oct 28

k-CNF is a standard form of propositional logic formulas: it consists of a conjunction of several clauses, each clause being a disjunction of at most k literals (variables or their negations).

Unverified50%
Oct 28

After encoding the agent routing graph as k-CNF, "does a deadlock path exist" is equivalent to asking whether the formula is satisfiable (SAT).

Unverified50%
Oct 28

SharpLogic's k-CNF encoding and #F counting can cover the finite state space of routing and retry logic, provided the graph is modeled correctly; if agent behavior depends on non-enumerable external states (such as open-ended text returned by tools), the formal model can only handle them abstractly, possibly producing false positives or false negatives.

Unverified50%

All Facts (4)

Source Articles