Struct G91CompatibilityReduction 

pub struct G91CompatibilityReduction { /* private fields */ }

Modal-free programs and frozen-relation bindings for a Gelfond-1991 compatibility greatest fixpoint.

The upper-bound program removes only selected positive possible gates in a recursive component. The refinement program replaces those same gates with reads from frozen snapshots of the preceding iteration. Re-evaluating the refinement from the original extensional inputs until the selected relations stop changing computes compatibility per concrete tuple instead of assuming that predicate-level strongly connected component membership is sufficient.

Implementations

impl G91CompatibilityReduction

pub fn upper_bound_program(&self) -> &Program

Program whose selected compatibility gates are removed to establish the finite initial upper bound.

pub fn refinement_program(&self) -> &Program

Program whose selected compatibility gates read the preceding iteration’s frozen relation snapshots.

pub fn snapshot_relations(&self) -> &BTreeMap<String, String>

Source relation to collision-free frozen snapshot relation name.

pub fn convergence_predicates(&self) -> &[String]

Intensional relations compared for convergence after each refinement.

Trait Implementations

impl Clone for G91CompatibilityReduction

fn clone(&self) -> G91CompatibilityReduction

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for G91CompatibilityReduction

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.