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 |
LastLinkOrder<T extends Invertable> |
class |
RuleComparator<T extends Invertable> |
class |
SimpleAspicOrder<T extends Invertable> |
class |
WeakestLinkOrder<T extends Invertable> |
Modifier and Type | Class and Description |
---|---|
class |
AspicParser<T extends Invertable> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractAspicReasoner<T extends Invertable>
The abstract ancestor of all Aspic reasoner implementations
|
class |
ModuleBasedAspicReasoner<T extends Invertable>
Slightly optimised reasoner for ASPIC.
|
class |
NaiveAspicReasoner<T extends Invertable> |
class |
RandomAspicReasoner<T extends Invertable>
This class implements an approximate reasoner for ASPIC+ that randomly
samples arguments.
|
Modifier and Type | Class and Description |
---|---|
class |
RuleFormulaGenerator<T extends Invertable> |
Modifier and Type | Class and Description |
---|---|
class |
AspicAttack<T extends Invertable> |
class |
SimpleAspicOrder<T extends Invertable> |
Modifier and Type | Method and Description |
---|---|
static <T extends Invertable> |
AspicAttack.determineAttackRelations(java.util.Collection<AspicArgument<T>> args,
java.util.Comparator<AspicArgument<T>> order,
RuleFormulaGenerator<T> rfgen)
Checks for defeats in a list of arguments
|
static <T extends Invertable> |
AspicAttack.isAttack(AspicArgument<T> active,
AspicArgument<T> passive,
RuleFormulaGenerator<T> rfgen,
java.util.Comparator<AspicArgument<T>> order)
Determines whether the attack is successfull
|
Modifier and Type | Class and Description |
---|---|
class |
AspicArgument<T extends Invertable> |
class |
AspicArgumentationTheory<T extends Invertable> |
class |
DefeasibleInferenceRule<T extends Invertable> |
class |
InferenceRule<T extends Invertable> |
class |
StrictInferenceRule<T extends Invertable> |
Modifier and Type | Field and Description |
---|---|
private T |
AspicArgument.conc
The conclusion of the argument's top rule
|
private T |
InferenceRule.conclusion
The rule's conclusion
|
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 | Class and Description |
---|---|
class |
RelationalFormula
This is the abstract base class for relational formulas,
i.e.
|
Modifier and Type | Interface and Description |
---|---|
interface |
ClassicalFormula
This interface models a classical formula, i.e.
|
Modifier and Type | Method and Description |
---|---|
Invertable |
Invertable.complement() |
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 |
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 | 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 |
DLPLiteral
This interface defines common functionality for an ELP literal.
|
Modifier and Type | Class and Description |
---|---|
class |
DLPAtom
This class models an atom, which is a basic structure for
building literals and rules for logic programs.
|
class |
DLPNeg
This class models strict negation for atoms.
|
Modifier and Type | Class and Description |
---|---|
class |
NLPNot
A default negation of a first order formula, nested logic programs
only allow not quantified formulas.
|