class SetTheory extends CombArray
A theory of typed sets, implementing using combinatorial arrays.
- Alphabetic
- By Inheritance
- SetTheory
- CombArray
- 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
- val _combinators: IndexedSeq[Predicate]
- Definition Classes
- CombArray
- val _combinators2: IndexedSeq[Predicate]
- Definition Classes
- CombArray
- val allAxioms: IFormula
- Definition Classes
- CombArray
- val arTheory: theories.ExtArray
- val arraySorts: IndexedSeq[ArraySort]
- Definition Classes
- CombArray
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- val axiom1: IFormula
- Definition Classes
- CombArray
- val axiom2: IFormula
- Definition Classes
- CombArray
- 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()
- def comb2comb2Eager(goal: Goal, subTheoryInd: Int, arrayTerms: Set[LinearCombination]): Seq[Action]
- def comb2comb2Lazy(goal: Goal, subTheoryInd: Int, checkedPreds: Seq[Predicate], checkComb: Boolean): Seq[Action]
- val combinatorSpecs: IndexedSeq[CombinatorSpec]
- Definition Classes
- CombArray
- val combinators: IndexedSeq[IFunction]
The functions resulting from lifting the object combinators to arrays.
The functions resulting from lifting the object combinators to arrays.
- Definition Classes
- CombArray
- val combinators2: IndexedSeq[IFunction]
The functions resulting from lifting the object combinators to arrays.
The functions resulting from lifting the object combinators to arrays.
- Definition Classes
- CombArray
- val combinators2PerArray: IndexedSeq[IndexedSeq[Predicate]]
- val combinators2PerArrayArgs: IndexedSeq[IndexedSeq[(Predicate, Seq[Int])]]
- val combinatorsPerArray: IndexedSeq[IndexedSeq[Predicate]]
- val compl: IFunction
- def consumedArrayTerms(goal: Goal, subTheoryInd: Int): Set[LinearCombination]
- def contains(set: ITerm, el: ITerm): IFormula
el in set.el in set. TODO: turn this into a proper predicate. - val dependencies: IndexedSeq[Theory]
Optionally, other theories that this theory depends on.
- val elementSort: Sort
- def emptySet: ITerm
{}.{}. TODO: turn this into a proper function. - 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 expandExtensionality(goal: Goal, extTheoryInd: Int, additionalFuns: Seq[(Predicate, Seq[Int])] = List()): Seq[Action]
- 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
- val extraDependencies: Seq[Theory]
- Definition Classes
- CombArray
- val funPredMap: Map[IFunction, Predicate]
- Definition Classes
- CombArray
- val functionPredicateMapping: IndexedSeq[(IFunction, 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: IndexedSeq[IFunction]
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.
Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover. This method will be applied very early in the translation process.
- Definition Classes
- Theory
- def including(set: ITerm, el: ITerm): ITerm
union(set, {el}).union(set, {el}). TODO: turn this into a proper function. - val indexSorts: Seq[Sort]
- Definition Classes
- CombArray
- 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 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()
- val objSorts: IndexedSeq[Sort]
- Definition Classes
- CombArray
- val plugin: Some[Plugin]
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, 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 applied to the raw formulas, before calling
Internal2Inputabsy.- Definition Classes
- Theory
- 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, order: TermOrder): 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
- 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
- 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: ArraySort
- val subTheories: IndexedSeq[theories.ExtArray]
- Definition Classes
- CombArray
- 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
- 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])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)