trait TreesAndTypesDomain extends PropositionalLogic with CheckableTreeAndTypeAnalysis
- Alphabetic
- By Inheritance
- TreesAndTypesDomain
- CheckableTreeAndTypeAnalysis
- PropositionalLogic
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Type Members
-
trait
AbsVar
extends AnyRef
- Definition Classes
- PropositionalLogic
-
final
case class
And
(ops: Set[Prop]) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
case class
AtMostOne
(ops: List[Sym]) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
case class
Eq
(p: Var, q: Const) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
case class
Not
(a: Prop) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
case class
Or
(ops: Set[Prop]) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
class
Prop
extends AnyRef
- Definition Classes
- PropositionalLogic
-
trait
PropMap
extends AnyRef
- Definition Classes
- PropositionalLogic
-
trait
PropTraverser
extends AnyRef
- Definition Classes
- PropositionalLogic
-
final
case class
Solution
(model: Model, unassigned: List[Sym]) extends Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
class
Sym
extends Prop
- Definition Classes
- PropositionalLogic
-
trait
TypeConstExtractor
extends AnyRef
- Definition Classes
- PropositionalLogic
-
trait
ValueConstExtractor
extends AnyRef
- Definition Classes
- PropositionalLogic
-
trait
VarExtractor
extends AnyRef
- Definition Classes
- PropositionalLogic
- sealed abstract class Const extends AnyRef
-
type
Model = Map[Sym, Boolean]
- Definition Classes
- PropositionalLogic
-
abstract
type
Solvable
- Definition Classes
- PropositionalLogic
-
type
Tree = Global.Tree
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
-
type
Type = Global.Type
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
- sealed class TypeConst extends Const
- sealed class ValueConst extends Const
- class Var extends AbsVar
Abstract Value Members
-
abstract
val
EmptyModel: Model
- Definition Classes
- PropositionalLogic
-
abstract
val
NoModel: Model
- Definition Classes
- PropositionalLogic
-
abstract
def
eqFreePropToSolvable(f: Prop): Solvable
- Definition Classes
- PropositionalLogic
-
abstract
def
findAllModelsFor(solvable: Solvable, pos: Position = NoPosition): List[Solution]
- Definition Classes
- PropositionalLogic
-
abstract
def
findModelFor(solvable: Solvable): Model
- Definition Classes
- PropositionalLogic
-
abstract
def
reportWarning(message: String): Unit
- Definition Classes
- PropositionalLogic
-
abstract
val
typer: (analyzer)#Typer
- Definition Classes
- CheckableTreeAndTypeAnalysis
-
abstract
def
uncheckedWarning(pos: Position, msg: String): Unit
- Definition Classes
- PropositionalLogic
Concrete Value Members
-
object
AnalysisBudget
- Definition Classes
- PropositionalLogic
-
object
And
extends Serializable
- Definition Classes
- PropositionalLogic
-
object
False
extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
object
Or
extends Serializable
- Definition Classes
- PropositionalLogic
-
object
Sym
- Definition Classes
- PropositionalLogic
-
object
True
extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to any2stringadd[TreesAndTypesDomain] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
->[B](y: B): (TreesAndTypesDomain, B)
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to ArrowAssoc[TreesAndTypesDomain] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
def
/\(props: Iterable[Prop]): Product with Serializable with Prop
- Definition Classes
- PropositionalLogic
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
\/(props: Iterable[Prop]): Product with Serializable with Prop
- Definition Classes
- PropositionalLogic
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
val
budgetProp: sys.Prop[String]
- Definition Classes
- PropositionalLogic
-
def
checkableType(tp: Global.Type): Global.Type
- Definition Classes
- CheckableTreeAndTypeAnalysis
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
ensuring(cond: (TreesAndTypesDomain) ⇒ Boolean, msg: ⇒ Any): TreesAndTypesDomain
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to Ensuring[TreesAndTypesDomain] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (TreesAndTypesDomain) ⇒ Boolean): TreesAndTypesDomain
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to Ensuring[TreesAndTypesDomain] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): TreesAndTypesDomain
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to Ensuring[TreesAndTypesDomain] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): TreesAndTypesDomain
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to Ensuring[TreesAndTypesDomain] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
enumerateSubtypes(tp: Global.Type, grouped: Boolean): List[List[Global.Type]]
- Definition Classes
- CheckableTreeAndTypeAnalysis
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to StringFormat[TreesAndTypesDomain] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
def
gatherSymbols(p: Prop): Set[Sym]
- Definition Classes
- PropositionalLogic
-
def
gatherVariables(p: Prop): Set[Var]
- Definition Classes
- PropositionalLogic
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
prepareNewAnalysis(): Unit
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
-
def
propToSolvable(p: Prop): Solvable
- Definition Classes
- PropositionalLogic
-
def
removeVarEq(props: List[Prop], modelNull: Boolean = false): (Prop, List[Prop])
- Definition Classes
- PropositionalLogic
-
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
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
uncheckableType(tp: Global.Type): Boolean
- Definition Classes
- CheckableTreeAndTypeAnalysis
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
→[B](y: B): (TreesAndTypesDomain, B)
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to ArrowAssoc[TreesAndTypesDomain] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- object Const
-
object
NullConst
extends Const with Product with Serializable
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
-
object
TypeConst
extends TypeConstExtractor
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
-
object
ValueConst
extends ValueConstExtractor
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
-
object
Var
extends VarExtractor
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
The Scala compiler and reflection APIs.