object Conjunction
- Alphabetic
- By Inheritance
- Conjunction
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- val FALSE: Conjunction
- val TRUE: Conjunction
- def apply(quans: Seq[Quantifier], arithConj: ArithConj, predConj: PredConj, negatedConjs: NegatedConjunctions, order: TermOrder): Conjunction
Create a
Conjunction
from an arbitrary collection of formulas.Create a
Conjunction
from an arbitrary collection of formulas. It is required that all given formulas are sorted by the specifiedorder
. - def apply(quans: Seq[Quantifier], formulas: Iterable[Formula], order: TermOrder): Conjunction
- def apply(quans: Seq[Quantifier], formulas: Iterator[Formula], order: TermOrder): Conjunction
- def apply(quans: Seq[Quantifier], formulas: Iterator[Formula], logger: ComputationLogger, order: TermOrder): Conjunction
Create a
Conjunction
from an arbitrary collection of formulas.Create a
Conjunction
from an arbitrary collection of formulas. It is required that all given formulas are sorted by the specifiedorder
. - final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
- def collectQuantifiers(f: Formula): Set[Quantifier]
Default: divisibility is not counted (but we count immediately preceeding quantifiers)
- def collectQuantifiers(f: Formula, divCollector: (Conjunction) => Set[Quantifier]): Set[Quantifier]
Determine the quantifiers that occur in a formula.
Determine the quantifiers that occur in a formula. Because there are different points of view, a function can be given as parameter that determines whether (quantified) divisibility/indivisibility statements are counted as quantifiers
- def compare(c1: Conjunction, c2: Conjunction, order: TermOrder): Int
Rudimentary sorting of conjunctions.
Rudimentary sorting of conjunctions. TODO: improve this (a lot)
- def conj(f: Formula, order: TermOrder): Conjunction
- def conj(formulas: Iterable[Formula], order: TermOrder): Conjunction
- def conj(formulas: Iterator[Formula], order: TermOrder): Conjunction
Compute a conjunction from an arbitrary set of formulas
- def conjOrdering(order: TermOrder): Ordering[Conjunction]
Rudimentary sorting of conjunctions.
Rudimentary sorting of conjunctions. TODO: improve this (a lot)
- def createFromNormalised(quans: Seq[Quantifier], arithConj: ArithConj, predConj: PredConj, negatedConjs: NegatedConjunctions, order: TermOrder): Conjunction
Create a
Conjunction
from different parts that are already normalised.Create a
Conjunction
from different parts that are already normalised. This primarily means thatnegatedConjs
must not contain any conjunctions that are just literals, and that quantifiers are pulled out completely if the conjunction only has a single conjunct. - def disj(formulas: Iterable[Conjunction], order: TermOrder): Conjunction
- def disj(formulas: Iterator[Conjunction], order: TermOrder): Conjunction
- def disjFor(formulas: Iterable[Formula], order: TermOrder): Conjunction
- def disjFor(formulas: Iterator[Formula], order: TermOrder): Conjunction
Compute a disjunction from an arbitrary set of formulas
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def eqv(for1: Formula, for2: Formula, order: TermOrder): Conjunction
Form the equivalence between two formulas
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def implies(for1: Formula, for2: Formula, order: TermOrder): Conjunction
Form the implication between two formulas
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def negate(f: Formula, order: TermOrder): Conjunction
Negate a formula
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def quantify(quan: Quantifier, constants: Seq[ConstantTerm], f: Formula, order: TermOrder): Conjunction
Quantify a number of constants in a formula, i.e., replace the constants with variables and add quantifiers
- def quantify(quans: Seq[Quantifier], f: Formula, order: TermOrder): Conjunction
Quantify a formula
- def reverseConjOrdering(order: TermOrder): Ordering[Conjunction]
Rudimentary reverse sorting of conjunctions.
Rudimentary reverse sorting of conjunctions. TODO: improve this (a lot)
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)