Theory

Type Members

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.
trait DecoderContext extends AnyRef
class DefaultDecoderContext extends DecoderContext

Decoder context that will extract all data from the given model.
Decoder context that will extract all data from the given model.
trait TheoryDecoderData extends AnyRef

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
object SatSoundnessConfig extends Enumeration
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

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

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
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.
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
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.
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
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

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

Compute the list of simplifiers defined by the theories.
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.
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.
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
def rewritePredsHelp(f: Conjunction, negated: Boolean, order: TermOrder)(rewrite: (Atom, Boolean) ⇒ Formula): Conjunction
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

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

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: trait Theory | package theories

object Theory

Type Members

trait Decoder[A] extends AnyRef

trait DecoderContext extends AnyRef

class DefaultDecoderContext extends DecoderContext

trait TheoryDecoderData extends AnyRef

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object SatSoundnessConfig extends Enumeration

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def iPostprocess(f: IFormula, theories: Seq[Theory], signature: Signature): IFormula

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

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def postSimplifiers(theories: Seq[Theory]): Seq[(IExpression) ⇒ IExpression]

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

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

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

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

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped