| Modifier and Type | Class and Description | 
|---|---|
class  | 
AlwaysQuery
This class represents an always query in the action query language S. 
 | 
class  | 
HoldsQuery
This class represents a holds query in the action query language S. 
 | 
class  | 
NecessarilyQuery
This class represents a necessarily query in the action query language S. 
 | 
class  | 
QueryProposition
Action queries are represented as propositional formulas with three possible
 types of propositions: holds, always and necessarily propositions. 
 | 
| 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  | 
AbstractGraphLdoModality
Provides common functionalities for the graph-based modalities in LDO. 
 | 
class  | 
AbstractLdoModality
Provides common functionalities for all modalities in LDO. 
 | 
class  | 
LdoArgument
This class represents an argument in ldo. 
 | 
class  | 
LdoAssociativeFormula
This class captures the common functionalities of formulas with an associative
 operation like conjunction, disjunction, etc. 
 | 
class  | 
LdoBoxModality  | 
class  | 
LdoConjunction
This class represents a conjunction in ldo logic. 
 | 
class  | 
LdoDiamondModality  | 
class  | 
LdoDisjunction
This class represents a disjunction in ldo logic. 
 | 
class  | 
LdoFormula
This abstract class specifies the general methods of all Ldo-formulas
 (LDO - Logic of dialectical outcomes, cf. 
 | 
class  | 
LdoGraphBoxModality  | 
class  | 
LdoGraphDiamondModality  | 
class  | 
LdoNegation
This class models classical negation of ldo logic. 
 | 
class  | 
LdoRelation
Creates a relational formula, i.e. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
<C extends SimpleLogicalFormula> | 
LdoAssociativeFormula.getFormulas(java.lang.Class<C> cls)  | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
Conditional
This class represents a basic conditional (B|A) with formulas A,B. 
 | 
| 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. 
 | 
| 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. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
<T extends SimpleLogicalFormula> | 
AssociativeFormulaSupport.AssociativeSupportBridge.createEmptyFormula()  | 
<C extends SimpleLogicalFormula> | 
AssociativeFormulaSupport.getFormulas(java.lang.Class<C> cls)  | 
| Modifier and Type | Interface and Description | 
|---|---|
interface  | 
AssociativeFormula<T extends SimpleLogicalFormula>
This interfaces describes associative formulas like a disjunction or
 a conjunction. 
 | 
| Modifier and Type | Interface and Description | 
|---|---|
interface  | 
AssociativeFormula<T extends SimpleLogicalFormula>
This interfaces describes associative formulas like a disjunction or
 a conjunction. 
 | 
interface  | 
Atom
An atomic language construct, linked to its predicate 
 | 
interface  | 
ClassicalFormula
This interface models a classical formula, i.e. 
 | 
interface  | 
ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
 interface provides methods to substitute and exchange those terms. 
 | 
interface  | 
Conjuctable
Formulas implementing this interface can be connected by using
 AND. 
 | 
interface  | 
Disjunctable
Formulas implementing this interface can be connected using
 OR. 
 | 
interface  | 
Invertable
Formulas implementing this interface have a
 complement 
 | 
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 | 
|---|---|
<C extends SimpleLogicalFormula> | 
AssociativeFormula.getFormulas(java.lang.Class<C> cls)
Process the formulas of type C that are children of this associative
 formula 
 | 
| Modifier and Type | Method and Description | 
|---|---|
SimpleLogicalFormula | 
SimpleLogicalFormula.clone()
Creates a deep copy of this formula 
 | 
SimpleLogicalFormula | 
Conjuctable.combineWithAnd(Conjuctable f)
Returns a conjunction of this and the given formula. 
 | 
SimpleLogicalFormula | 
Disjunctable.combineWithOr(Disjunctable f)  | 
SimpleLogicalFormula | 
QuantifiedFormula.getFormula()  | 
| 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  | 
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  | 
ExistsQuantifiedFormula  | 
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 formula. 
 | 
class  | 
Negation
The classical negation of first-order logic. 
 | 
class  | 
QuantifiedFormula
The common parent of exists and forall quantified formulas, which contains common
 functionalities. 
 | 
class  | 
RelationalFormula
This interface models a relational formula, i.e. 
 | 
class  | 
SpecialFormula
This class captures the common functionalities of the special
 formulas tautology and contradiction. 
 | 
class  | 
Tautology
A tautological formula. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
<C extends SimpleLogicalFormula> | 
AssociativeFOLFormula.getFormulas(java.lang.Class<C> cls)  | 
| 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  | 
ProbabilisticConditional
This class represents a probabilistic conditional of the form (B|A)[p]
 with formulas A,B and a probability p. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
AssociativePropositionalFormula
This class captures the common functionalities of formulas with an associative
 operation like conjunction, disjunction, etc. 
 | 
class  | 
Proposition
This class represents a simple proposition in propositional logic. 
 | 
class  | 
PropositionalFormula
This class represents the common ancestor for propositional formulae. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
<C extends SimpleLogicalFormula> | 
AssociativePropositionalFormula.getFormulas(java.lang.Class<C> cls)  | 
| 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 | Method and Description | 
|---|---|
<A extends AssociativeFormula<? extends SimpleLogicalFormula>> | 
Translator.translateAssociative(A source,
                    java.lang.Class<?> assocCls)
Translates the given AssociativeFormula into another AssociativeFormula
 thats type is given by the parameter assocCls 
 | 
| Modifier and Type | Method and Description | 
|---|---|
SimpleLogicalFormula | 
Translator.translateUsingMap(SimpleLogicalFormula source)  | 
| Modifier and Type | Method and Description | 
|---|---|
SimpleLogicalFormula | 
Translator.translateUsingMap(SimpleLogicalFormula source)  | 
| Modifier and Type | Method and Description | 
|---|---|
Rule<?,?> | 
Translator.translateRule(Rule<? extends SimpleLogicalFormula,? extends SimpleLogicalFormula> source,
             java.lang.Class<?> ruleCls)  | 
Rule<?,?> | 
Translator.translateRule(Rule<? extends SimpleLogicalFormula,? extends SimpleLogicalFormula> source,
             java.lang.Class<?> ruleCls)  | 
| Modifier and Type | Method and Description | 
|---|---|
SimpleLogicalFormula | 
AspFolTranslator.translateUsingMap(SimpleLogicalFormula source)  | 
| Modifier and Type | Method and Description | 
|---|---|
SimpleLogicalFormula | 
AspFolTranslator.translateUsingMap(SimpleLogicalFormula source)  | 
| 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 acts as abstract base class for classes 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 | Method and Description | 
|---|---|
<T extends SimpleLogicalFormula> | 
DLPHead.createEmptyFormula()  | 
<C extends SimpleLogicalFormula> | 
DLPHead.getFormulas(java.lang.Class<C> cls)  | 
| Modifier and Type | Method and Description | 
|---|---|
SimpleLogicalFormula | 
DLPHead.combineWithOr(Disjunctable f)  | 
| 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. 
 |