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 |
AssociativeFormulaSupport<T extends SimpleLogicalFormula>
This class provides common implementation for associative formulas
that are formulas which consists of several other formulas.
|
class |
ComplexLogicalFormulaAdapter
Abstract base class for ComplexLogicalFormula, that are formulas which
implement substitute(), exchange(), getTerms(), isGround() and isWellFormed()
and therefore use terms to describe themself.
|
class |
RelationalFormula
This is the abstract base class for relational formulas,
i.e.
|
Modifier and Type | Method and Description |
---|---|
private ComplexLogicalFormula |
AssociativeFormulaSupport.checkedFormulaType(T formula) |
abstract ComplexLogicalFormula |
ComplexLogicalFormulaAdapter.clone() |
ComplexLogicalFormula |
ComplexLogicalFormulaAdapter.exchange(Term<?> v,
Term<?> t) |
ComplexLogicalFormula |
ComplexLogicalFormulaAdapter.substitute(java.util.Map<? extends Term<?>,? extends Term<?>> map) |
ComplexLogicalFormula |
AssociativeFormulaSupport.substitute(Term<?> v,
Term<?> t) |
Modifier and Type | Interface and Description |
---|---|
interface |
QuantifiedFormula
Interface for a QuantifiedFormula with a set of quantified variables
implementing an all- or exist-quantor for example.
|
Modifier and Type | Method and Description |
---|---|
ComplexLogicalFormula |
ComplexLogicalFormula.clone() |
ComplexLogicalFormula |
ComplexLogicalFormula.exchange(Term<?> v,
Term<?> t)
Substitutes all occurrences of term "v" in this formula
by term "t" and at the same time replaces all occurrences of term "t"
by term "v" and eventually returns the new formula.
|
ComplexLogicalFormula |
ComplexLogicalFormula.substitute(java.util.Map<? extends Term<?>,? extends Term<?>> map)
Substitutes all occurrences of all terms "v" in map.keyset() in this formula
by map.get(v) and returns the new formula.
|
ComplexLogicalFormula |
ComplexLogicalFormula.substitute(Term<?> v,
Term<?> t)
Substitutes all occurrences of term "v" in this formula
by term "t" and returns the new formula.
|
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 | Interface and Description |
---|---|
interface |
DLPElement
This interface defines base methods every element of a
program has to provide.
|
interface |
DLPLiteral
This interface defines common functionality for an ELP literal.
|
Modifier and Type | Class and Description |
---|---|
class |
Aggregate
This class represents an aggregate function.
|
class |
Arithmetic
This class implements the Arithmetic semantic given
by the DLV Manual.
|
class |
Comparative
This class implements comparative predicates as described in
the DLV manual.
|
class |
DLPAtom
This class models an atom, which is a basic structure for
building literals and rules for logic programs.
|
class |
DLPElementAdapter
This class acts as an abstract base class for classes that implement
the ELPElement interface.
|
class |
DLPHead
This formula represents the head of an disjunctive rule which is a
disjunction of ELP literals.
|
class |
DLPNeg
This class models strict negation for atoms.
|
class |
DLPNot
This class models a default negated literal.
|
class |
Rule
This class models a rule for a disjunctive logic program.
|
Modifier and Type | Class and Description |
---|---|
class |
NLPNot
A default negation of a first order formula, nested logic programs
only allow not quantified formulas.
|
class |
NLPRule
A rule of a nested logic program.
|