Modifier and Type | Class and Description |
---|---|
class |
DefeasibleRule
This class models a defeasible rule in defeasible logic programming.
|
class |
DelpFact
This class implements a fact in defeasible logic programming which encapsulates a literal.
|
class |
DelpRule
This method is the superclass for both a strict rule and a defeasible rule in defeasible logic programming
and captures their common attributes and methods.
|
class |
StrictRule
This class models a strict rule in defeasible logic programming.
|
Modifier and Type | Class and Description |
---|---|
class |
RelationalFormula
This is the abstract base class for relational formulas,
i.e.
|
Modifier and Type | Class and Description |
---|---|
class |
AssociativeFOLFormula
This class captures the common functionalities first order associative formulas like conjunction,
disjunction, etc.
|
class |
Conjunction
The classical conjunction of first-order logic.
|
class |
Contradiction
A contradictory formula.
|
class |
Disjunction
The classical disjunction of first-order logic.
|
class |
Equivalence
The equivalence of first-order logic.
|
class |
ExistsQuantifiedFormula
Exists-quantified first-order logic formula.
|
class |
FOLAtom
An atom in first-order logic, i.e.
|
class |
FolFormula
The common abstract class for formulas of first-order logic.
|
class |
ForallQuantifiedFormula
For-All-quantified first-order logic formula.
|
class |
Implication
The implication of first-order logic.
|
class |
Negation
The classical negation of first-order logic.
|
class |
SpecialFormula
This class captures the common functionalities of the special
formulas tautology and contradiction.
|
class |
Tautology
A tautological formula.
|
Modifier and Type | Class and Description |
---|---|
class |
ModalFormula
This class models a modal formula, i.e.
|
class |
Necessity
This class models the necessity modality.
|
class |
Possibility
This class models the possibility modality.
|
Modifier and Type | Class and Description |
---|---|
class |
MlnFormula
Instances of this class represent first-order formulas with a weight.
|
Modifier and Type | Class and Description |
---|---|
class |
RelationalConditional
Instances of this class represent relational conditionals.
|
Modifier and Type | Class and Description |
---|---|
class |
DefaultRule
Models a default rule in Reiter's default logic, see [R.
|
Modifier and Type | Class and Description |
---|---|
class |
RelationalProbabilisticConditional
This class represents a relational probabilistic conditional, i.e.
|
Modifier and Type | Class and Description |
---|---|
class |
NLPNot
A default negation of a first order formula, nested logic programs
only allow not quantified formulas.
|