Enum Node 

pub enum Node {
    True,
    Atom(AtomId),
    Not(FormulaId),
    And(FormulaId, FormulaId),
    Knows(AgentId, FormulaId),
    Believes(AgentId, FormulaId),
    Safe(AgentId, FormulaId),
    CondBel(AgentId, FormulaId, FormulaId),
    Common(AgentMask, FormulaId),
}

One node of the formula DAG. §4.2 fixes the operator set at six.

Variants

True

Verum.

Atom(AtomId)

An atomic proposition.

Not(FormulaId)

Negation.

And(FormulaId, FormulaId)

Conjunction.

Knows(AgentId, FormulaId)

K[i] φ — box over ~ᵢ.

Believes(AgentId, FormulaId)

B[i] φ — box over Belᵢ.

Safe(AgentId, FormulaId)

□[i] φ — box over Rᵢ.

CondBel(AgentId, FormulaId, FormulaId)

B^ψ[i] φ — arguments are (agent, ψ, φ).

Common(AgentMask, FormulaId)

C[g] φ — box over the reflexive-transitive closure of ∪_{i∈g} ~ᵢ.

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl Eq for Node

impl Hash for Node

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Node

fn eq(&self, other: &Node) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Node