Packages

object Theory

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Theory
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. trait Decoder[A] extends AnyRef

    In some theories, complex values will internally be encoded as integers.

    In some theories, complex values will internally be encoded as integers. Decoders are used to translate back to foreground objects.

  2. trait DecoderContext extends AnyRef
  3. class DefaultDecoderContext extends DecoderContext

    Decoder context that will extract all data from the given model.

  4. trait TheoryDecoderData extends AnyRef
  5. trait TheorySort extends Sort

    Trait for sorts that belong to a specific theory.

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  8. def genAxioms(theoryFunctions: Seq[IFunction] = List(), theoryAxioms: IFormula = IExpression.i(true), extraPredicates: Seq[Predicate] = List(), genTotalityAxioms: Boolean = false, preOrder: TermOrder = TermOrder.EMPTY, functionEnc: FunctionEncoder = new FunctionEncoder(true, false), otherTheories: Seq[Theory] = List()): (Seq[Predicate], Formula, TermOrder, Map[IFunction, Predicate])

    Preprocess a set of axioms and convert them to internal representation.

  9. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  11. def iPostprocess(f: IFormula, theories: Seq[Theory], signature: Signature): IFormula

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination.

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination. This method will be called form within ap.parser.Postprocessing.

  12. def iPreprocess(f: IFormula, theories: Seq[Theory], signature: Signature): (IFormula, Signature)

    Apply preprocessing to a formula over some set of theories, prior to sending the formula to a prover.

    Apply preprocessing to a formula over some set of theories, prior to sending the formula to a prover. This method will be called form within ap.parser.Preprocessing

  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. def isModelGenPredicate(p: Predicate): Boolean

    Test whether p belongs to any set Theory.modelGenPredicates.

  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  18. def postSimplifiers(theories: Seq[Theory]): Seq[(IExpression) => IExpression]

    Compute the list of simplifiers defined by the theories.

  19. def postprocess(f: Conjunction, theories: Seq[Theory], order: TermOrder): Conjunction

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination.

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination. This method will be called form within ap.parser.Postprocessing.

  20. def preprocess(f: Conjunction, theories: Seq[Theory], order: TermOrder): Conjunction

    Apply preprocessing to a formula over some set of theories, prior to sending the formula to a prover.

  21. def rewritePreds(f: Conjunction, order: TermOrder)(rewrite: (Atom, Boolean) => Formula): Conjunction

    Apply a uniform substitution to a formula, rewriting atoms to arbitrary new formulas.

    Apply a uniform substitution to a formula, rewriting atoms to arbitrary new formulas. TODO: optimise

  22. def rewritePredsHelp(f: Conjunction, negated: Boolean, order: TermOrder)(rewrite: (Atom, Boolean) => Formula): Conjunction
  23. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  24. def toString(): String
    Definition Classes
    AnyRef → Any
  25. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  26. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  27. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  28. object SatSoundnessConfig extends Enumeration

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

    (Since version 9)

Inherited from AnyRef

Inherited from Any

Ungrouped