Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. formatSpine :: Spine -> String

    epub-metadata Codec.Epub.Format.Spine

    Format an epub Spine structure for pretty printing

  2. formatSubline :: String -> Maybe String -> String

    epub-metadata Codec.Epub.Format.Util

    No documentation available.

  3. formulaAnd :: Literal -> [Literal] -> Formula

    ersatz Ersatz.Internal.Formula

    The boolean and operation Derivation of the Tseitin transformation:

    O ≡ (A & B & C)
    (O → (A & B & C)) & (¬O → ¬(A & B & C))
    (¬O | (A & B & C)) & (O | ¬(A & B & C))
    (¬O | A) & (¬O | B) & (¬O | C) & (O | ¬A | ¬B | ¬C)
    

  4. formulaEmpty :: Formula

    ersatz Ersatz.Internal.Formula

    A formula with no clauses

  5. formulaFAC :: Literal -> Literal -> Literal -> Literal -> Formula

    ersatz Ersatz.Internal.Formula

    No documentation available.

  6. formulaFAS :: Literal -> Literal -> Literal -> Literal -> Formula

    ersatz Ersatz.Internal.Formula

    No documentation available.

  7. formulaLiteral :: Literal -> Formula

    ersatz Ersatz.Internal.Formula

    Assert a literal

  8. formulaMux :: Literal -> Literal -> Literal -> Literal -> Formula

    ersatz Ersatz.Internal.Formula

    The boolean else-then-if or mux operation Derivation of the Tseitin transformation:

    O ≡ (F & ¬P) | (T & P)
    (O → ((F & ¬P) | (T & P))) & (¬O → ¬((F & ¬P) | (T & P)))
    
    Left hand side:
    O → ((F & ¬P) | (T & P))
    ¬O | ((F & ¬P) | (T & P))
    ¬O | ((F | T) & (F | P) & (T | ¬P) & (¬P | P))
    ¬O | ((F | T) & (F | P) & (T | ¬P))
    (¬O | F | T) & (¬O | F | P) & (¬O | T | ¬P)
    
    Right hand side:
    ¬O → ¬((F & ¬P) | (T & P))
    O | ¬((F & ¬P) | (T & P))
    O | (¬(F & ¬P) & ¬(T & P))
    O | ((¬F | P) & (¬T | ¬P))
    (O | ¬F | P) & (O | ¬T | ¬P)
    
    Result:
    (¬O | F | T) & (¬O | F | P) & (¬O | T | ¬P) & (O | ¬F | P) & (O | ¬T | ¬P)
    
    with redundant clauses, cf. discussion in Een and Sorensen, Translating Pseudo Boolean Constraints ..., p. 7 http://minisat.se/Papers.html

  9. formulaNot :: Literal -> Literal -> Formula

    ersatz Ersatz.Internal.Formula

    The boolean not operation Derivation of the Tseitin transformation:

    O ≡ ¬A
    (O → ¬A) & (¬O → A)
    (¬O | ¬A) & (O | A)
    

  10. formulaOr :: Literal -> [Literal] -> Formula

    ersatz Ersatz.Internal.Formula

    The boolean or operation Derivation of the Tseitin transformation:

    O ≡ (A | B | C)
    (O → (A | B | C)) & (¬O → ¬(A | B | C))
    (¬O | (A | B | C)) & (O | ¬(A | B | C))
    (¬O | A | B | C) & (O | (¬A & ¬B & ¬C))
    (¬O | A | B | C) & (O | ¬A) & (O | ¬B) & (O | ¬C)
    

Page 161 of many | Previous | Next