Contents
Index
logic-classes-1.4.7: Framework for propositional and first order logic, theorem proving
A
B
C
D
E
F
G
H
I
L
M
N
O
P
Q
R
S
T
U
V
W
Y
Z
:
!
.
<
=
?
|
All
Index - S
satisfiable
1 (Function)
Data.Logic.Classes.ClauseNormalForm
2 (Function)
Data.Logic.Harrison.Prop
3 (Function)
Data.Logic.Satisfiable
SatSolver
Data.Boolean.SatSolver
selectBranchVar
Data.Boolean.SatSolver
Sentence
Data.Logic.Instances.Chiou
setAll
Data.Logic.Harrison.Lib
setAny
Data.Logic.Harrison.Lib
setmapfilter
Data.Logic.Harrison.Lib
SetOfSupport
Data.Logic.Resolution
settryfind
Data.Logic.Harrison.Lib
showApply
Data.Logic.Classes.Apply
showAtomEq
Data.Logic.Classes.Equals
showFirstOrder
Data.Logic.Classes.FirstOrder
showFirstOrderFormulaEq
Data.Logic.Classes.Equals
showKB
Data.Logic.KnowledgeBase
showPropositional
Data.Logic.Classes.Propositional
showTerm
Data.Logic.Classes.Term
showVariable
Data.Logic.Classes.Variable
simpcnf
1 (Function)
Data.Logic.Harrison.Prop
2 (Function)
Data.Logic.Harrison.Normal
simpcnf'
Data.Logic.Harrison.Normal
simpdnf
1 (Function)
Data.Logic.Harrison.Prop
2 (Function)
Data.Logic.Harrison.Normal
simpdnf'
Data.Logic.Harrison.Normal
simplify
Data.Logic.Harrison.Skolem
Skolem
1 (Type/Class)
Data.Logic.Classes.Skolem
2 (Type/Class)
Data.Logic.Harrison.Skolem
3 (Data Constructor)
Data.Logic.Types.Harrison.FOL
skolem
Data.Logic.Harrison.Skolem
skolemize
Data.Logic.Harrison.Skolem
skolemNormalForm
Data.Logic.Harrison.Skolem
SkolemT
Data.Logic.Harrison.Skolem
solve
1 (Function)
Data.Boolean.SatSolver
2 (Function)
Data.Logic.Harrison.Unif
specialize
Data.Logic.Harrison.Skolem
subcnf
Data.Logic.Harrison.DefCNF
subst
Data.Logic.Harrison.FOL
subst'
Data.Logic.Harrison.Herbrand
substApply
Data.Logic.Classes.Apply
substAtomEq
Data.Logic.Classes.Equals
substitute
Data.Logic.Classes.Atom
Success
Data.Logic.Failing