Object/Trait

ap.theories

Theory

Related Docs: trait Theory | package theories

Permalink

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. All

Type Members

  1. trait Decoder[A] extends AnyRef

    Permalink

    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

    Permalink
  3. class DefaultDecoderContext extends DecoderContext

    Permalink

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

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

  4. trait TheoryDecoderData extends AnyRef

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. object SatSoundnessConfig extends Enumeration

    Permalink
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. 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])

    Permalink

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

  11. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  12. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  13. def iPostprocess(f: IFormula, theories: Seq[Theory], signature: Signature): IFormula

    Permalink

    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.

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

    Permalink

    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

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  16. def isModelGenPredicate(p: Predicate): Boolean

    Permalink

    Test whether p belongs to any set Theory.modelGenPredicates.

    Test whether p belongs to any set Theory.modelGenPredicates.

  17. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. def postSimplifiers(theories: Seq[Theory]): Seq[(IExpression) ⇒ IExpression]

    Permalink

    Compute the list of simplifiers defined by the theories.

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

    Permalink

    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.

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

    Permalink

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

  23. def rewritePreds(f: Conjunction, order: TermOrder)(rewrite: (Atom, Boolean) ⇒ Formula): Conjunction

    Permalink

    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

  24. def rewritePredsHelp(f: Conjunction, negated: Boolean, order: TermOrder)(rewrite: (Atom, Boolean) ⇒ Formula): Conjunction

    Permalink
  25. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  26. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  27. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped