trait PropositionalLogic extends AnyRef
- Alphabetic
- By Inheritance
- PropositionalLogic
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Type Members
- trait AbsVar extends AnyRef
- final case class And(ops: Set[Prop]) extends Prop with Product with Serializable
- final case class AtMostOne(ops: List[Sym]) extends Prop with Product with Serializable
- abstract type Const
- final case class Eq(p: Var, q: Const) extends Prop with Product with Serializable
- type Model = Map[Sym, Boolean]
- final case class Not(a: Prop) extends Prop with Product with Serializable
- final case class Or(ops: Set[Prop]) extends Prop with Product with Serializable
- sealed abstract class Prop extends AnyRef
- trait PropMap extends AnyRef
- trait PropTraverser extends AnyRef
- final case class Solution(model: Model, unassigned: List[Sym]) extends Product with Serializable
- abstract type Solvable
- final class Sym extends Prop
- abstract type Tree
- abstract type Type
- abstract type TypeConst <: Const
- trait TypeConstExtractor extends AnyRef
- abstract type ValueConst <: Const
- trait ValueConstExtractor extends AnyRef
- abstract type Var <: AbsVar
- trait VarExtractor extends AnyRef
Abstract Value Members
- abstract val EmptyModel: Model
- abstract val NoModel: Model
- abstract val NullConst: Const
- abstract def TypeConst: TypeConstExtractor
- abstract def ValueConst: ValueConstExtractor
- abstract val Var: VarExtractor
- abstract def eqFreePropToSolvable(f: Prop): Solvable
- abstract def findAllModelsFor(solvable: Solvable, sym: Global.Symbol = NoSymbol): List[Solution]
- abstract def hasModel(solvable: Solvable): Boolean
- abstract def prepareNewAnalysis(): Unit
- abstract def reportWarning(message: String): Unit
- abstract def uncheckedWarning(pos: Global.Position, msg: String, site: Global.Symbol): Unit
Concrete Value Members
- 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 PropositionalLogic toany2stringadd[PropositionalLogic] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ->[B](y: B): (PropositionalLogic, B)
- Implicit
- This member is added by an implicit conversion from PropositionalLogic toArrowAssoc[PropositionalLogic] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- def /\(props: Iterable[Prop]): Prop
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def \/(props: Iterable[Prop]): Prop
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def ensuring(cond: (PropositionalLogic) => Boolean, msg: => Any): PropositionalLogic
- Implicit
- This member is added by an implicit conversion from PropositionalLogic toEnsuring[PropositionalLogic] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (PropositionalLogic) => Boolean): PropositionalLogic
- Implicit
- This member is added by an implicit conversion from PropositionalLogic toEnsuring[PropositionalLogic] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): PropositionalLogic
- Implicit
- This member is added by an implicit conversion from PropositionalLogic toEnsuring[PropositionalLogic] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): PropositionalLogic
- Implicit
- This member is added by an implicit conversion from PropositionalLogic toEnsuring[PropositionalLogic] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[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 PropositionalLogic toStringFormat[PropositionalLogic] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
- def gatherSymbols(p: Prop): Set[Sym]
- def gatherVariables(p: Prop): Set[Var]
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def propToSolvable(p: Prop): Solvable
- def removeVarEq(props: List[Prop], modelNull: Boolean = false): (Prop, List[Prop])
- 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 https://www.decision-procedures.org/slides/propositional_logic-2x3.pdf
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- object AnalysisBudget
- object And extends java.io.Serializable
- case object False extends Prop with Product with Serializable
- object Or extends java.io.Serializable
- object Sym
- case object True extends Prop with Product with Serializable
Deprecated Value Members
- def →[B](y: B): (PropositionalLogic, B)
- Implicit
- This member is added by an implicit conversion from PropositionalLogic toArrowAssoc[PropositionalLogic] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->
instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
The Scala compiler and reflection APIs.