class SetTheory extends Theory with SMTLinearisableTheory
A theory of typed sets, implementing using combinatorial arrays.
- Alphabetic
- By Inheritance
- SetTheory
- SMTLinearisableTheory
- Theory
- 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
- def SMTDeclarationSideEffects: Seq[Theory]
A list of (other) theories that are implicitly declared as a side-effect of declaring this theory.
A list of (other) theories that are implicitly declared as a side-effect of declaring this theory. We assume that theories can implicitly define some of their dependencies, but not vice versa.
- Definition Classes
- SMTLinearisableTheory
- val all: MonoSortedIFunction
Set of all elements.
- val arTheory: ExtArray
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- val axioms: Formula
Axioms defining the theory; such axioms are simply added as formulae to the problem to be proven, and thus handled using the standard reasoning techniques (including e-matching).
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
- val combArTheory: CombArray
- val compl: IFunction
- def contains(set: ITerm, el: ITerm): IFormula
el in set.el in set. TODO: turn this into a proper predicate. - val dependencies: List[CombArray]
Optionally, other theories that this theory depends on.
- val elementSort: Sort
- val emptySet: MonoSortedIFunction
{}. - final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def evalFun(f: IFunApp): Option[ITerm]
Optionally, a function evaluating theory functions applied to concrete arguments, represented as constructor terms.
Optionally, a function evaluating theory functions applied to concrete arguments, represented as constructor terms.
- Definition Classes
- Theory
- def evalPred(p: IAtom): Option[Boolean]
Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.
Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.
- Definition Classes
- Theory
- def evaluatingSimplifier(t: IExpression): IExpression
A simplification function that applies the methods
evalFunandevalPredto some given expression (but not recursively).A simplification function that applies the methods
evalFunandevalPredto some given expression (but not recursively). This is used in theTheory.postSimplifiersmethods.- Definition Classes
- Theory
- def excluding(set: ITerm, el: ITerm): ITerm
- def extend(order: TermOrder): TermOrder
Add the symbols defined by this theory to the
orderAdd the symbols defined by this theory to the
order- Definition Classes
- Theory
- def fun2SMTString(f: IFunction): Option[String]
Translate a function belonging to this theory to an SMT-LIB identifier.
Translate a function belonging to this theory to an SMT-LIB identifier.
- Definition Classes
- SetTheory → SMTLinearisableTheory
- val funPredMap: Map[IFunction, Predicate]
- val functionPredicateMapping: List[(MonoSortedIFunction, Predicate)]
Mapping of interpreted functions to interpreted predicates, used translating input ASTs to internal ASTs (the latter only containing predicates).
- val functionalPredicates: Set[Predicate]
Information which of the predicates satisfy the functionality axiom; at some internal points, such predicates can be handled more efficiently
- val functions: List[MonoSortedIFunction]
Interpreted functions of the theory
- def generateDecoderData(model: Conjunction): Option[TheoryDecoderData]
If this theory defines any
Theory.Decoder, which can translate model data into some theory-specific representation, this function can be overridden to pre-compute required data from a model.If this theory defines any
Theory.Decoder, which can translate model data into some theory-specific representation, this function can be overridden to pre-compute required data from a model.- Definition Classes
- Theory
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def iPostprocess(f: IFormula, 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 applied to the formula after calling
Internal2Inputabsy.- Definition Classes
- Theory
- def iPreprocess(f: IFormula, signature: Signature): (IFormula, Signature)
Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.
- def including(set: ITerm, el: ITerm): ITerm
- val insert: MonoSortedIFunction
union(set, {el}). - final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isSoundForSat(theories: Seq[Theory], config: Theory.SatSoundnessConfig.Value): Boolean
Check whether we can tell that the given combination of theories is sound for checking satisfiability of a problem, i.e., if proof construction ends up in a dead end, can it be concluded that a problem is satisfiable.
- val isect: IFunction
- val member: MonoSortedPredicate
el in set - val minus: IFunction
- val modelGenPredicates: Set[Predicate]
Optionally, a set of predicates used by the theory to tell the
PresburgerModelFinderabout terms that will be handled exclusively by this theory.Optionally, a set of predicates used by the theory to tell the
PresburgerModelFinderabout terms that will be handled exclusively by this theory. If a proof goal in model generation mode contains an atomp(x), forpin this set, then thePresburgerModelFinderwill ignorexwhen assigning concrete values to symbols.- Definition Classes
- Theory
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def plugin: None
Optionally, a plug-in implementing reasoning in this theory
- def postSimplifiers: Seq[(IExpression) => IExpression]
Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier.
Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier. Such simplifiers are invoked by
ap.parser.Simplifier. By default, this list will only include theevaluatingSimplifier.- Definition Classes
- Theory
- def postprocess(f: Conjunction, signature: Signature): 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 applied to the raw formulas, before calling
Internal2Inputabsy.- Definition Classes
- Theory
- def pred2SMTString(p: Predicate): Option[String]
Translate a predicate belonging to this theory to an SMT-LIB identifier.
Translate a predicate belonging to this theory to an SMT-LIB identifier.
- Definition Classes
- SetTheory → SMTLinearisableTheory
- val predefPredicates: List[MonoSortedPredicate]
- val predicateMatchConfig: PredicateMatchConfig
Information how interpreted predicates should be handled for e-matching.
- val predicates: Seq[Predicate]
Interpreted predicates of the theory
- def preprocess(f: Conjunction, signature: Signature): Conjunction
Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.
Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.
- Definition Classes
- Theory
- def printSMTDeclaration: Unit
Print an SMT-LIB declaration of this theory; do not output anything if the theory does not need to be declared.
Print an SMT-LIB declaration of this theory; do not output anything if the theory does not need to be declared.
- Definition Classes
- SMTLinearisableTheory
- val reducerPlugin: ReducerPluginFactory
Optionally, a plugin for the reducer applied to formulas both before and during proving.
Optionally, a plugin for the reducer applied to formulas both before and during proving.
- Definition Classes
- Theory
- val remove: MonoSortedIFunction
set \ {el}. - def set(els: ITerm*): ITerm
{el1, ..., eln}. - val singleInstantiationPredicates: Set[Predicate]
When instantiating existentially quantifier formulas,
EX phi, at most one instantiation is necessary provided that all predicates inphiare contained in this set.When instantiating existentially quantifier formulas,
EX phi, at most one instantiation is necessary provided that all predicates inphiare contained in this set.- Definition Classes
- Theory
- val sort: SetSort.type
- def sort2SMTType(s: Sort): Option[SMTType]
Translate a sort belonging to this theory to an SMT type.
Translate a sort belonging to this theory to an SMT type.
- Definition Classes
- SetTheory → SMTLinearisableTheory
- def subsetOf(set1: ITerm, set2: ITerm): IFormula
set1is a subset ofset2.set1is a subset ofset2. TODO: turn this into a proper predicate. - final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- SetTheory → AnyRef → Any
- val totalityAxioms: Conjunction
Additional axioms that are included if the option
+genTotalityAxiomsis given to Princess. - lazy val transitiveDependencies: Iterable[Theory]
Dependencies closed under transitivity, i.e., also including the dependencies of dependencies.
Dependencies closed under transitivity, i.e., also including the dependencies of dependencies.
- Definition Classes
- Theory
- val triggerRelevantFunctions: Set[IFunction]
A list of functions that should be considered in automatic trigger generation
- val union: IFunction
- 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])
- object SetSort extends ProxySort with TheorySort
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)