at
.
logic
.
skeptik
.
algorithm
.
compressor
.
combinedRPILU
AddEval
trait
AddEval
extends
RegularizationEvaluation
Linear Supertypes
RegularizationEvaluation
,
LeftHeuristic
,
Intersection
,
UnitsCollectingBeforeFixing
,
AbstractRPIAlgorithm
,
AbstractRPILUAlgorithm
, (
SequentProof
) ⇒
SequentProof
, AnyRef,
Any
Ordering
Alphabetic
By inheritance
Inherited
Hide All
Show all
AddEval
RegularizationEvaluation
LeftHeuristic
Intersection
UnitsCollectingBeforeFixing
AbstractRPIAlgorithm
AbstractRPILUAlgorithm
Function1
AnyRef
Any
Visibility
Public
All
Type Members
class
DeletedSide
extends AnyRef
Attributes
protected sealed abstract
Abstract Value Members
def
collectInformationMap
(
nodeCollection:
ProofNodeCollection
[
SequentProof
]
)
:
HashMap
[
SequentProof
,
RegularizationInformation
]
Attributes
abstract
Definition Classes
RegularizationEvaluation
def
lowerInsteadOfRegularize
(
proof:
SequentProof
,
currentChildrenNumber:
Int
,
information:
RegularizationInformation
,
safeLiterals:
SetSequent
)
:
Boolean
Attributes
abstract
Definition Classes
RegularizationEvaluation
Concrete Value Members
def
!=
(
arg0: AnyRef
)
:
Boolean
Attributes
final
Definition Classes
AnyRef
def
!=
(
arg0:
Any
)
:
Boolean
Attributes
final
Definition Classes
Any
def
##
()
:
Int
Attributes
final
Definition Classes
AnyRef → Any
def
==
(
arg0: AnyRef
)
:
Boolean
Attributes
final
Definition Classes
AnyRef
def
==
(
arg0:
Any
)
:
Boolean
Attributes
final
Definition Classes
Any
object
LeftDS
extends DeletedSide
Attributes
protected
object
RightDS
extends DeletedSide
Attributes
protected
def
addMap
(
ma:
Map
[
E
,
Float
]
,
mb:
Map
[
E
,
Float
]
)
:
Map
[
E
,
Float
]
def
andThen
[
A
]
(
g: (
SequentProof
) ⇒ A
)
: (
SequentProof
) ⇒ A
Definition Classes
Function1
def
apply
(
proof:
SequentProof
)
:
SequentProof
Definition Classes
RegularizationEvaluation
→ Function1
def
asInstanceOf
[
T0
]
: T0
Attributes
final
Definition Classes
Any
def
childIsMarkedToDeleteParent
(
child:
SequentProof
,
parent:
SequentProof
,
edgesToDelete:
Map
[
SequentProof
,
DeletedSide
]
)
:
Boolean
Definition Classes
AbstractRPILUAlgorithm
def
clone
()
: AnyRef
Attributes
protected[
lang
]
Definition Classes
AnyRef
Annotations
@throws
()
def
compose
[
A
]
(
g: (A) ⇒
SequentProof
)
: (A) ⇒
SequentProof
Definition Classes
Function1
def
computeSafeLiterals
(
proof:
SequentProof
,
childrensSafeLiterals: List[(
SequentProof
,
SetSequent
)]
,
edgesToDelete:
Map
[
SequentProof
,
DeletedSide
]
,
safeLiteralsFromChild: ((
SequentProof
,
SetSequent
)) ⇒
SetSequent
)
:
SetSequent
Definition Classes
Intersection
→
AbstractRPIAlgorithm
def
deleteFromChildren
(
oldProof:
SequentProof
,
nodeCollection:
ProofNodeCollection
[
SequentProof
]
,
edgesToDelete:
HashMap
[
SequentProof
,
DeletedSide
]
)
:
Unit
Definition Classes
AbstractRPILUAlgorithm
def
eq
(
arg0: AnyRef
)
:
Boolean
Attributes
final
Definition Classes
AnyRef
def
equals
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
evaluateDerivation
(
proof:
SequentProof
,
nodeCollection:
ProofNodeCollection
[
SequentProof
]
,
aux:
E
,
leftInfo:
RegularizationInformation
,
rightInfo:
RegularizationInformation
)
:
RegularizationInformation
Definition Classes
AddEval
→
RegularizationEvaluation
def
fakeSize
[
A
]
(
l: List[A]
)
:
Int
Definition Classes
AbstractRPILUAlgorithm
def
finalize
()
:
Unit
Attributes
protected[
lang
]
Definition Classes
AnyRef
Annotations
@throws
()
def
fixProofs
(
edgesToDelete:
Map
[
SequentProof
,
DeletedSide
]
)
(
p:
SequentProof
,
fixedPremises: List[
SequentProof
]
)
:
SequentProof
Definition Classes
AbstractRPILUAlgorithm
def
getClass
()
: java.lang.Class[_]
Attributes
final
Definition Classes
AnyRef → Any
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
def
heuristicChoose
(
left:
SequentProof
,
right:
SequentProof
)
:
SequentProof
Definition Classes
LeftHeuristic
→
AbstractRPILUAlgorithm
def
isInstanceOf
[
T0
]
:
Boolean
Attributes
final
Definition Classes
Any
def
isUnit
(
proof:
SequentProof
,
nodeCollection:
ProofNodeCollection
[
SequentProof
]
)
:
Boolean
Definition Classes
AbstractRPILUAlgorithm
def
mapFixedProofs
(
proofsToMap: Set[
SequentProof
]
,
edgesToDelete:
Map
[
SequentProof
,
DeletedSide
]
,
nodeCollection:
ProofNodeCollection
[
SequentProof
]
)
:
HashMap
[
SequentProof
,
SequentProof
]
Definition Classes
UnitsCollectingBeforeFixing
def
ne
(
arg0: AnyRef
)
:
Boolean
Attributes
final
Definition Classes
AnyRef
def
notify
()
:
Unit
Attributes
final
Definition Classes
AnyRef
def
notifyAll
()
:
Unit
Attributes
final
Definition Classes
AnyRef
def
sideOf
(
parent:
SequentProof
,
child:
SequentProof
)
:
DeletedSide
Definition Classes
AbstractRPILUAlgorithm
def
synchronized
[
T0
]
(
arg0: ⇒ T0
)
: T0
Attributes
final
Definition Classes
AnyRef
def
toString
()
:
String
Definition Classes
Function1 → AnyRef → Any
def
wait
()
:
Unit
Attributes
final
Definition Classes
AnyRef
Annotations
@throws
()
def
wait
(
arg0:
Long
,
arg1:
Int
)
:
Unit
Attributes
final
Definition Classes
AnyRef
Annotations
@throws
()
def
wait
(
arg0:
Long
)
:
Unit
Attributes
final
Definition Classes
AnyRef
Annotations
@throws
()
Inherited from
RegularizationEvaluation
Inherited from
LeftHeuristic
Inherited from
Intersection
Inherited from
UnitsCollectingBeforeFixing
Inherited from
AbstractRPIAlgorithm
Inherited from
AbstractRPILUAlgorithm
Inherited from (
SequentProof
) ⇒
SequentProof
Inherited from AnyRef
Inherited from
Any