Packages

t

scala.tools.nsc.transform.patmat.Logic

PropositionalLogic

trait PropositionalLogic extends AnyRef

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PropositionalLogic
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. trait AbsVar extends AnyRef
  2. final case class And(ops: Set[Prop]) extends Prop with Product with Serializable
  3. final case class AtMostOne(ops: List[Sym]) extends Prop with Product with Serializable
  4. abstract type Const
  5. final case class Eq(p: Var, q: Const) extends Prop with Product with Serializable
  6. type Model = Map[Sym, Boolean]
  7. final case class Not(a: Prop) extends Prop with Product with Serializable
  8. final case class Or(ops: Set[Prop]) extends Prop with Product with Serializable
  9. class Prop extends AnyRef
  10. trait PropMap extends AnyRef
  11. trait PropTraverser extends AnyRef
  12. final case class Solution(model: Model, unassigned: List[Sym]) extends Product with Serializable
  13. abstract type Solvable
  14. final class Sym extends Prop
  15. abstract type Tree
  16. abstract type Type
  17. abstract type TypeConst <: Const
  18. trait TypeConstExtractor extends AnyRef
  19. abstract type ValueConst <: Const
  20. trait ValueConstExtractor extends AnyRef
  21. abstract type Var <: AbsVar
  22. trait VarExtractor extends AnyRef

Abstract Value Members

  1. abstract val EmptyModel: Model
  2. abstract val NoModel: Model
  3. abstract val NullConst: Const
  4. abstract def TypeConst: TypeConstExtractor
  5. abstract def ValueConst: ValueConstExtractor
  6. abstract val Var: VarExtractor
  7. abstract def eqFreePropToSolvable(f: Prop): Solvable
  8. abstract def findAllModelsFor(solvable: Solvable, pos: Position = NoPosition): List[Solution]
  9. abstract def findModelFor(solvable: Solvable): Model
  10. abstract def prepareNewAnalysis(): Unit
  11. abstract def reportWarning(message: String): Unit
  12. abstract def uncheckedWarning(pos: Position, msg: String): Unit

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def /\(props: Iterable[Prop]): Product with Serializable with Prop
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. def \/(props: Iterable[Prop]): Product with Serializable with Prop
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. val budgetProp: sys.Prop[String]
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. def gatherSymbols(p: Prop): Set[Sym]
  13. def gatherVariables(p: Prop): Set[Var]
  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  20. def propToSolvable(p: Prop): Solvable
  21. def removeVarEq(props: List[Prop], modelNull: Boolean = false): (Prop, List[Prop])
  22. def simplify(f: Prop): Prop

    Simplifies propositional formula according to the following rules: - eliminate double negation (avoids unnecessary Tseitin variables) - flatten trees of same connectives (avoids unnecessary Tseitin variables) - removes constants and connectives that are in fact constant because of their operands - eliminates duplicate operands - convert formula into NNF: all sub-expressions have a positive polarity which makes them amenable for the subsequent Plaisted transformation and increases chances to figure out that the formula is already in CNF

    Simplifies propositional formula according to the following rules: - eliminate double negation (avoids unnecessary Tseitin variables) - flatten trees of same connectives (avoids unnecessary Tseitin variables) - removes constants and connectives that are in fact constant because of their operands - eliminates duplicate operands - convert formula into NNF: all sub-expressions have a positive polarity which makes them amenable for the subsequent Plaisted transformation and increases chances to figure out that the formula is already in CNF

    Complexity: DFS over formula tree

    See http://www.decision-procedures.org/slides/propositional_logic-2x3.pdf

  23. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  24. def toString(): String
    Definition Classes
    AnyRef → Any
  25. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  28. object AnalysisBudget
  29. object And extends Serializable
  30. object False extends Prop with Product with Serializable
  31. object Or extends Serializable
  32. object Sym
  33. object True extends Prop with Product with Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped