pub enum ModalStrategy {
AllWorldsMin,
AllWorldsProduct,
Threshold {
threshold: f64,
},
}Expand description
Strategy for compiling modal logic operators (Box □, Diamond ◇).
Variants§
AllWorldsMin
All worlds must satisfy (min reduction over worlds)
- Box: min_w P(w)
- Diamond: max_w P(w)
AllWorldsProduct
Product over all worlds
- Box: ∏_w P(w)
- Diamond: 1 - ∏_w (1 - P(w))
Threshold
Threshold-based satisfaction
- Box: ∀w. P(w) > threshold
- Diamond: ∃w. P(w) > threshold
Trait Implementations§
Source§impl Clone for ModalStrategy
impl Clone for ModalStrategy
Source§fn clone(&self) -> ModalStrategy
fn clone(&self) -> ModalStrategy
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for ModalStrategy
impl Debug for ModalStrategy
Source§impl<'de> Deserialize<'de> for ModalStrategy
impl<'de> Deserialize<'de> for ModalStrategy
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl PartialEq for ModalStrategy
impl PartialEq for ModalStrategy
Source§impl Serialize for ModalStrategy
impl Serialize for ModalStrategy
impl Copy for ModalStrategy
impl Eq for ModalStrategy
impl StructuralPartialEq for ModalStrategy
Auto Trait Implementations§
impl Freeze for ModalStrategy
impl RefUnwindSafe for ModalStrategy
impl Send for ModalStrategy
impl Sync for ModalStrategy
impl Unpin for ModalStrategy
impl UnwindSafe for ModalStrategy
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.