Scala Compiler2.12.3-1 < Back
 

# Packages

-  package root

  The Scala compiler and reflection APIs.

  The Scala compiler and reflection APIs.

  Definition Classes
    root
-  package scala
  Definition Classes
    root
-  package tools
  Definition Classes
    scala
-  package nsc
  Definition Classes
    tools
-  package transform
  Definition Classes
    nsc
-  package patmat
  Definition Classes
    transform
-  trait Solving extends Logic

  Solve pattern matcher exhaustivity problem via DPLL.

  Solve pattern matcher exhaustivity problem via DPLL.

  Definition Classes
    patmat
- CNF
- PropositionalLogic
- Solver
- debug

t

scala.tools.nsc.transform.patmat.Solving

# Solver 

###

#### trait Solver extends CNF

Source
  Solving.scala

Linear Supertypes
CNF, Solving.PropositionalLogic, AnyRef, Any
Known Subclasses
OptimizingMatchTranslator
Type Hierarchy
 
Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. Solver
2. CNF
3. PropositionalLogic
4. AnyRef
5. Any

Implicitly

1. by any2stringadd
2. by StringFormat
3. by Ensuring
4. by ArrowAssoc

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.  class AlreadyInCNF extends AnyRef
    Definition Classes
      CNF
16.  trait CnfBuilder extends AnyRef
    Definition Classes
      CNF
17.  final case class Solvable (cnf: Cnf, symbolMapping: SymbolMapping) extends Product with Serializable
    Definition Classes
      CNF
18.  class SymbolMapping extends AnyRef
    Definition Classes
      CNF
19.  class TransformToCnf extends CnfBuilder

    Plaisted transformation: used for conversion of a propositional formula into conjunctive normal form (CNF) (input format for SAT solver).

    Plaisted transformation: used for conversion of a propositional formula into conjunctive normal form (CNF) (input format for SAT solver). A simple conversion into CNF via Shannon expansion would also be possible but it's worst-case complexity is exponential (in the number of variables) and thus even simple problems could become untractable. The Plaisted transformation results in an _equisatisfiable_ CNF-formula (it generates auxiliary variables) but runs with linear complexity. The common known Tseitin transformation uses bi-implication, whereas the Plaisted transformation uses implication only, thus the resulting CNF formula has (on average) only half of the clauses of a Tseitin transformation. The Plaisted transformation uses the polarities of sub-expressions to figure out which part of the bi-implication can be omitted. However, if all sub-expressions have positive polarity (e.g., after transformation into negation normal form) then the conversion is rather simple and the pseudo-normalization via NNF increases chances only one side of the bi-implication is needed.

    Definition Classes
      CNF
20.  type Clause = Set[Lit]
    Definition Classes
      CNF
21.  type Cnf = Array[Clause]

    Conjunctive normal form (of a Boolean formula).

    Conjunctive normal form (of a Boolean formula). A formula in this form is amenable to a SAT solver (i.e., solver that decides satisfiability of a formula).

    Definition Classes
      CNF
22.  abstract type Const
    Definition Classes
      PropositionalLogic
23.  type Model = Map[Sym, Boolean]
    Definition Classes
      PropositionalLogic
24.  abstract type Tree
    Definition Classes
      PropositionalLogic
25.  type TseitinModel = Set[Lit]
26.  abstract type Type
    Definition Classes
      PropositionalLogic
27.  abstract type TypeConst <: Const
    Definition Classes
      PropositionalLogic
28.  abstract type ValueConst <: Const
    Definition Classes
      PropositionalLogic
29.  abstract type Var <: AbsVar
    Definition Classes
      PropositionalLogic

### Abstract Value Members

1.  abstract val NullConst: Const
   Definition Classes
     PropositionalLogic
2.  abstract def TypeConst: TypeConstExtractor
   Definition Classes
     PropositionalLogic
3.  abstract def ValueConst: ValueConstExtractor
   Definition Classes
     PropositionalLogic
4.  abstract val Var: VarExtractor
   Definition Classes
     PropositionalLogic
5.  abstract def prepareNewAnalysis(): Unit
   Definition Classes
     PropositionalLogic
6.  abstract def reportWarning(message: String): Unit
   Definition Classes
     PropositionalLogic
7.  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 +(other: String): String
   Implicit
     This member is added by an implicit conversion from Solver to any2stringadd[Solver] performed by method any2stringadd in scala.Predef.
   Definition Classes
     any2stringadd
10.  def ->[B](y: B): (Solver, B)
    Implicit
      This member is added by an implicit conversion from Solver to ArrowAssoc[Solver] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
      ArrowAssoc
    Annotations
      @inline()
11.  def /\(props: Iterable[Prop]): Product with Serializable with Prop
    Definition Classes
      PropositionalLogic
12.  final def ==(arg0: Any): Boolean
    Definition Classes
      AnyRef → Any
13.  val EmptyModel: Map[Sym, Boolean]
    Definition Classes
      Solver → PropositionalLogic
14.  val EmptyTseitinModel: Set[Lit]
15.  val NoModel: Model
    Definition Classes
      Solver → PropositionalLogic
16.  val NoTseitinModel: TseitinModel
17.  def \/(props: Iterable[Prop]): Product with Serializable with Prop
    Definition Classes
      PropositionalLogic
18.  final def asInstanceOf[T0]: T0
    Definition Classes
      Any
19.  val budgetProp: sys.Prop[String]
    Definition Classes
      PropositionalLogic
20.  def clause(l: Lit*): Clause
    Definition Classes
      CNF
21.  def clone(): AnyRef
    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
22.  def cnfString(f: Array[Clause]): String
    Definition Classes
      Solver → CNF
23.  def ensuring(cond: (Solver) ⇒ Boolean, msg: ⇒ Any): Solver
    Implicit
      This member is added by an implicit conversion from Solver to Ensuring[Solver] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
24.  def ensuring(cond: (Solver) ⇒ Boolean): Solver
    Implicit
      This member is added by an implicit conversion from Solver to Ensuring[Solver] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
25.  def ensuring(cond: Boolean, msg: ⇒ Any): Solver
    Implicit
      This member is added by an implicit conversion from Solver to Ensuring[Solver] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
26.  def ensuring(cond: Boolean): Solver
    Implicit
      This member is added by an implicit conversion from Solver to Ensuring[Solver] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
27.  final def eq(arg0: AnyRef): Boolean
    Definition Classes
      AnyRef
28.  def eqFreePropToSolvable(p: Prop): Solvable
    Definition Classes
      CNF → PropositionalLogic
29.  def equals(arg0: Any): Boolean
    Definition Classes
      AnyRef → Any
30.  def finalize(): Unit
    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( classOf[java.lang.Throwable] )
31.  def findAllModelsFor(solvable: Solvable, pos: Position): List[Solution]
    Definition Classes
      Solver → PropositionalLogic
32.  def findModelFor(solvable: Solvable): Model
    Definition Classes
      Solver → PropositionalLogic
33.  def findTseitinModelFor(clauses: Array[Clause]): TseitinModel
34.  def formatted(fmtstr: String): String
    Implicit
      This member is added by an implicit conversion from Solver to StringFormat[Solver] performed by method StringFormat in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @inline()
35.  def gatherSymbols(p: Prop): Set[Sym]
    Definition Classes
      PropositionalLogic
36.  def gatherVariables(p: Prop): Set[Var]
    Definition Classes
      PropositionalLogic
37.  final def getClass(): Class[_]
    Definition Classes
      AnyRef → Any
38.  def hashCode(): Int
    Definition Classes
      AnyRef → Any
39.  final def isInstanceOf[T0]: Boolean
    Definition Classes
      Any
40.  final def ne(arg0: AnyRef): Boolean
    Definition Classes
      AnyRef
41.  final def notify(): Unit
    Definition Classes
      AnyRef
42.  final def notifyAll(): Unit
    Definition Classes
      AnyRef
43.  def propToSolvable(p: Prop): Solvable
    Definition Classes
      PropositionalLogic
44.  def removeVarEq(props: List[Prop], modelNull: Boolean = false): (Prop, List[Prop])
    Definition Classes
      PropositionalLogic
45.  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
46.  final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
      AnyRef
47.  def toString(): String
    Definition Classes
      AnyRef → Any
48.  final def wait(): Unit
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
49.  final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
50.  final def wait(arg0: Long): Unit
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
51.  def →[B](y: B): (Solver, B)
    Implicit
      This member is added by an implicit conversion from Solver to ArrowAssoc[Solver] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
      ArrowAssoc

### Inherited from CNF

### Inherited from Solving.PropositionalLogic

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion any2stringadd from Solver to any2stringadd[Solver]

### Inherited by implicit conversion StringFormat from Solver to StringFormat[Solver]

### Inherited by implicit conversion Ensuring from Solver to Ensuring[Solver]

### Inherited by implicit conversion ArrowAssoc from Solver to ArrowAssoc[Solver]

### Ungrouped