Class/Object

ap.terfor.preds

ReduceWithPredLits

Related Docs: object ReduceWithPredLits | package preds

Permalink

class ReduceWithPredLits extends AnyRef

Class for reducing a conjunction of predicate literals using a set of known literals (facts). This reduction can be done modulo the axiom of functionality (for predicates encoding functions or partial functions), and then potentially replaces predicate literals with simple equations.

Linear Supertypes

AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

ReduceWithPredLits
AnyRef
Any

Hide All
Show All

Visibility

Public
All

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 addLits(furtherLits: PredConj): ReduceWithPredLits
def apply(conj: PredConj): (PredConj, ArithConj)

Reduce a conjunction of predicate literals using known predicate literals.
Reduce a conjunction of predicate literals using known predicate literals. This function knows about functional predicates, and is able to apply the functionality axiom to replace predicate literals with equations.
def apply(conj: PredConj, logger: ComputationLogger): (PredConj, ArithConj)

Reduce a conjunction of predicate literals using known predicate literals.
Reduce a conjunction of predicate literals using known predicate literals. This function knows about functional predicates, and is able to apply the functionality axiom to replace predicate literals with equations.
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] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
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 passQuantifiers(num: Int): ReduceWithPredLits

Create a ReduceWithPredLits that can be used underneath num binders.
Create a ReduceWithPredLits that can be used underneath num binders. The conversion of de Brujin-variables is done on the fly, which should give a good performance when the resulting ReduceWithEqs is not applied too often (TODO: caching)
def reductionPossible(conj: PredConj): Boolean

Determine whether a formula that contains the given predicates might be reducible by this reducer
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( ... )
lazy val withoutFacts: ReduceWithPredLits

A reducer corresponding to this one, but without assuming any facts known a priori.

Inherited from AnyRef

Inherited from Any

Ungrouped