Packages

trait TreesAndTypesDomain extends PropositionalLogic with CheckableTreeAndTypeAnalysis

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

Type Members

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

Abstract Value Members

  1. abstract val EmptyModel: Model
    Definition Classes
    PropositionalLogic
  2. abstract val NoModel: Model
    Definition Classes
    PropositionalLogic
  3. abstract def eqFreePropToSolvable(f: Prop): Solvable
    Definition Classes
    PropositionalLogic
  4. abstract def findAllModelsFor(solvable: Solvable, pos: Position = NoPosition): List[Solution]
    Definition Classes
    PropositionalLogic
  5. abstract def findModelFor(solvable: Solvable): Model
    Definition Classes
    PropositionalLogic
  6. abstract def reportWarning(message: String): Unit
    Definition Classes
    PropositionalLogic
  7. abstract val typer: (analyzer)#Typer
    Definition Classes
    CheckableTreeAndTypeAnalysis
  8. abstract def uncheckedWarning(pos: Position, msg: String): Unit
    Definition Classes
    PropositionalLogic

Concrete Value Members

  1. object AnalysisBudget
    Definition Classes
    PropositionalLogic
  2. object And extends Serializable
    Definition Classes
    PropositionalLogic
  3. object False extends Prop with Product with Serializable
    Definition Classes
    PropositionalLogic
  4. object Or extends Serializable
    Definition Classes
    PropositionalLogic
  5. object Sym
    Definition Classes
    PropositionalLogic
  6. object True extends Prop with Product with Serializable
    Definition Classes
    PropositionalLogic
  7. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. final def ##(): Int
    Definition Classes
    AnyRef → Any
  9. def /\(props: Iterable[Prop]): Product with Serializable with Prop
    Definition Classes
    PropositionalLogic
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def \/(props: Iterable[Prop]): Product with Serializable with Prop
    Definition Classes
    PropositionalLogic
  12. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  13. val budgetProp: sys.Prop[String]
    Definition Classes
    PropositionalLogic
  14. def checkableType(tp: Global.Type): Global.Type
    Definition Classes
    CheckableTreeAndTypeAnalysis
  15. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  16. def enumerateSubtypes(tp: Global.Type, grouped: Boolean): List[List[Global.Type]]
    Definition Classes
    CheckableTreeAndTypeAnalysis
  17. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  19. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  20. def gatherSymbols(p: Prop): Set[Sym]
    Definition Classes
    PropositionalLogic
  21. def gatherVariables(p: Prop): Set[Var]
    Definition Classes
    PropositionalLogic
  22. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  23. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  24. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  25. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  27. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  28. def prepareNewAnalysis(): Unit
  29. def propToSolvable(p: Prop): Solvable
    Definition Classes
    PropositionalLogic
  30. def removeVarEq(props: List[Prop], modelNull: Boolean = false): (Prop, List[Prop])
    Definition Classes
    PropositionalLogic
  31. 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

    Definition Classes
    PropositionalLogic
  32. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  33. def toString(): String
    Definition Classes
    AnyRef → Any
  34. def uncheckableType(tp: Global.Type): Boolean
    Definition Classes
    CheckableTreeAndTypeAnalysis
  35. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  38. object Const
  39. object NullConst extends Const with Product with Serializable
  40. object TypeConst extends TypeConstExtractor
  41. object ValueConst extends ValueConstExtractor
  42. object Var extends VarExtractor

Inherited from AnyRef

Inherited from Any

Ungrouped