ExhaustiveProver

A prover that tries to construct an exhaustive proof for a given goal. The prover tries to optimise by early stopping the expansion of the proof tree if it is detected that a certain subtree can never yield a satisfiable closing constraint. There are two main modes of operation: with depthFirst, it is tried to derive a satisfiable constraint from the given problem, without aiming for exhaustiveness. Without this option, the tree is expanded depth-first until it is exhaustive (which terminates in the case of PA formulae, but not in general).

Linear Supertypes

AnyRef, Any

Instance Constructors

new ExhaustiveProver(settings: GoalSettings)
new ExhaustiveProver(depthFirst: Boolean, settings: GoalSettings)

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 apply(inputFor: Formula, signature: Signature): ProofTree
def apply(inputFor: Formula, order: TermOrder): ProofTree
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
def isValidConstraint(constraint: Conjunction, signature: Signature): Boolean

A constraint is considered valid if the formula \forall universalConstants; \exists existentialConstants; constraint is valid
A constraint is considered valid if the formula \forall universalConstants; \exists existentialConstants; constraint is valid
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
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: object ExhaustiveProver | package proof

class ExhaustiveProver extends AnyRef

Instance Constructors

new ExhaustiveProver(settings: GoalSettings)

new ExhaustiveProver(depthFirst: Boolean, settings: GoalSettings)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(inputFor: Formula, signature: Signature): ProofTree

def apply(inputFor: Formula, order: TermOrder): ProofTree

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

final def isInstanceOf[T0]: Boolean

def isValidConstraint(constraint: Conjunction, signature: Signature): Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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