Uses of Interface
org.tweetyproject.logics.commons.syntax.interfaces.Invertable
Package
Description
-
Uses of Invertable in org.tweetyproject.action.query.syntax
Modifier and TypeClassDescriptionclass
This class represents an always query in the action query language S.class
This class represents a holds query in the action query language S.class
This class represents a necessarily query in the action query language S.class
Action queries are represented as propositional formulas with three possible types of propositions: "holds", "always" and "necessarily" propositions. -
Uses of Invertable in org.tweetyproject.arg.aba.semantics
Modifier and TypeMethodDescriptionstatic <T extends Invertable>
booleanAbaAttack.attacks
(Deduction<T> attacker, Assumption<T> attacked) True iff attacker attacks attacked -
Uses of Invertable in org.tweetyproject.arg.aspic.order
Modifier and TypeClassDescriptionclass
LastLinkOrder<T extends Invertable>
class
RuleComparator<T extends Invertable>
class
SimpleAspicOrder<T extends Invertable>
class
WeakestLinkOrder<T extends Invertable>
-
Uses of Invertable in org.tweetyproject.arg.aspic.parser
Modifier and TypeClassDescriptionclass
AspicParser<T extends Invertable>
Parses a Aspic Argumentation System out of an input text. -
Uses of Invertable in org.tweetyproject.arg.aspic.reasoner
Modifier and TypeClassDescriptionclass
AbstractAspicReasoner<T extends Invertable>
The abstract ancestor of all Aspic reasoner implementationsclass
DirectionalAspicReasoner<T extends Invertable>
Computes a restricted AF by only considering relevant arguments to a query.class
ModuleBasedAspicReasoner<T extends Invertable>
Slightly optimised reasoner for ASPIC.class
RandomAspicReasoner<T extends Invertable>
This class implements an approximate reasoner for ASPIC+ that randomly samples arguments.class
SimpleAspicReasoner<T extends Invertable>
-
Uses of Invertable in org.tweetyproject.arg.aspic.ruleformulagenerator
Modifier and TypeClassDescriptionclass
RuleFormulaGenerator<T extends Invertable>
This class transforms a defeasible ASPIC inference rule into a corresponding formula, i.e. -
Uses of Invertable in org.tweetyproject.arg.aspic.semantics
Modifier and TypeClassDescriptionclass
AspicAttack<T extends Invertable>
Checks whether an argument defeats another argumentclass
SimpleAspicOrder<T extends Invertable>
A simple comparator for Aspic Arguments, that compares their top rules according to a given list of rulesModifier and TypeMethodDescriptionstatic <T extends Invertable>
Collection<AspicAttack<T>> AspicAttack.determineAttackRelations
(Collection<AspicArgument<T>> args, Comparator<AspicArgument<T>> order, RuleFormulaGenerator<T> rfgen) Checks for defeats in a list of argumentsstatic <T extends Invertable>
booleanAspicAttack.isAttack
(AspicArgument<T> active, AspicArgument<T> passive, RuleFormulaGenerator<T> rfgen, Comparator<AspicArgument<T>> order) Determines whether the attack is successful -
Uses of Invertable in org.tweetyproject.arg.aspic.syntax
Modifier and TypeClassDescriptionclass
AspicArgument<T extends Invertable>
An argument according to the ASPIC+ specificationclass
AspicArgumentationTheory<T extends Invertable>
According to Modgil and Prakken, this represents an argumentation theory (AS, KB) with - AS argumentation system (e.g.class
DefeasibleInferenceRule<T extends Invertable>
Defeasible implementation ofInferenceRule<T>
class
InferenceRule<T extends Invertable>
This stands for an inference rule or for a premise if premises has length 0.class
StrictInferenceRule<T extends Invertable>
Indefeasible implementation ofInferenceRule<T>
Modifier and TypeMethodDescriptionstatic <T extends Invertable>
booleanAspicArgument.isAttack
(AspicArgument<T> active, AspicArgument<T> passive, RuleFormulaGenerator<T> rfgen, Comparator<AspicArgument<T>> order) Determines whether the attack is successful -
Uses of Invertable in org.tweetyproject.arg.aspic.writer
Modifier and TypeClassDescriptionclass
AspicWriter<T extends Invertable>
For writing ASPIC argumentation theories to disk. -
Uses of Invertable in org.tweetyproject.arg.delp.syntax
Modifier and TypeClassDescriptionclass
This class models a defeasible rule in defeasible logic programming.final class
This class implements a fact in defeasible logic programming which encapsulates a literal.class
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
This class models a strict rule in defeasible logic programming. -
Uses of Invertable in org.tweetyproject.arg.dung.ldo.syntax
Modifier and TypeClassDescriptionclass
Provides common functionalities for the graph-based modalities in LDO.class
Provides common functionalities for all modalities in LDO.class
This class represents an argument in ldo.class
This class captures the common functionalities of formulas with an associative operation like conjunction, disjunction, etc.class
Represents the box modality in the logic of dialectical outcomes (LDO).class
This class represents a conjunction in ldo logic.class
Represents the diamond modality in the logic of dialectical outcomes (LDO).class
This class represents a disjunction in ldo logic.class
This abstract class specifies the general methods of all Ldo-formulas (LDO - Logic of dialectical outcomes, cf.class
Represents the graph box modality in the logic of dialectical outcomes (LDO).class
Represents the graph diamond modality in the logic of dialectical outcomes (LDO).class
This class models classical negation of ldo logic.class
Creates a relational formula, i.e. -
Uses of Invertable in org.tweetyproject.logics.commons.syntax
Modifier and TypeClassDescriptionclass
This is the abstract base class for relational formulas, i.e. -
Uses of Invertable in org.tweetyproject.logics.commons.syntax.interfaces
Modifier and TypeInterfaceDescriptioninterface
This interface models a classical formula, i.e. -
Uses of Invertable in org.tweetyproject.logics.dl.syntax
Modifier and TypeClassDescriptionclass
This class captures the common functionalities of description logic associative formulas (union and intersection).class
This class models an atomic concept (aka concept name) in description logics.class
This class models a role in description logics.class
This class models the bottom concept (empty concept) in description logics.class
This class models the complement (negation) in description logics.class
The common abstract class for concepts (also called concepts, complex concepts or concept descriptions) of description logics.class
This class models an existential restriction in description logics, i.e.class
This class models an intersection in description logics.class
This class models the top concept (universal concept) in description logics.class
This class models an union in description logics.class
This class models an universal restriction in description logics, i.e. -
Uses of Invertable in org.tweetyproject.logics.fol.syntax
Modifier and TypeClassDescriptionclass
This class captures the common functionalities first order associative formulas like conjunction, disjunction, etc.class
The classical conjunction of first-order logic.class
A contradictory formula.class
The classical disjunction of first-order logic.class
The equivalence of first-order logic.class
The exclusive disjunction (XOR) in first-order logic.class
Exists-quantified first-order logic formula.class
An atom in first-order logic, i.e.class
The common abstract class for formulas of first-order logic.class
For-All-quantified first-order logic formula.class
The implication of first-order logic.class
The classical negation of first-order logic.class
This class captures the common functionalities of the special formulas tautology and contradiction.class
A tautological formula. -
Uses of Invertable in org.tweetyproject.logics.ml.syntax
Modifier and TypeClassDescriptionclass
This class models a modal formula, i.e.class
This class models the necessity modality.class
This class models the possibility modality. -
Uses of Invertable in org.tweetyproject.logics.mln.syntax
Modifier and TypeClassDescriptionclass
Instances of this class represent first-order formulas with a weight. -
Uses of Invertable in org.tweetyproject.logics.pl.syntax
Modifier and TypeClassDescriptionclass
This class captures the common functionalities of formulas with an associative operation like conjunction, disjunction, etc.class
This class represents a conjunction in propositional logic.class
A contradictory formula.class
This class represents a disjunction in propositional logic.class
This class models equivalence of propositional logic.class
This class represents an exclusive disjunction (XOR) in propositional logic.class
This class models the implication of propositional logic.class
This class models classical negation of propositional logic.class
This class represents the common ancestor for propositional formulae.class
This class represents a simple proposition in propositional logic.class
This class captures the common functionalities of the special formulas tautology and contradiction.class
A tautological formula. -
Uses of Invertable in org.tweetyproject.logics.qbf.syntax
Modifier and TypeClassDescriptionclass
This class represents existential quantification for boolean formulas.class
This class represents universal quantification for boolean formulas. -
Uses of Invertable in org.tweetyproject.logics.rcl.syntax
Modifier and TypeClassDescriptionclass
Instances of this class represent relational conditionals. -
Uses of Invertable in org.tweetyproject.logics.rdl.syntax
Modifier and TypeClassDescriptionclass
Models a default rule in Reiter's default logic, see [R. -
Uses of Invertable in org.tweetyproject.logics.rpcl.syntax
Modifier and TypeClassDescriptionclass
This class represents a relational probabilistic conditional, i.e. -
Uses of Invertable in org.tweetyproject.logics.translators.adfrevision
Modifier and TypeClassDescriptionclass
This class models an indecision operator for 3-valued propositional logic as proposed in [Heyninck 2020] Indecision(a) is true, if formula a is undecided Indecision(a) is false, if formula a is true or false Adapted from the class "Negation"class
This class models a weak negation for 3-valued propositional logic as proposed in [Heyninck 2020] Adapted from the class "Negation" -
Uses of Invertable in org.tweetyproject.lp.asp.syntax
Modifier and TypeClassDescriptionclass
This class models an atom, which is a basic structure for building literals and rules for logic programs.class
This class defines common functionality for literals, meaning atoms or strictly negated atoms.class
This class models the strict negation of an atom (as opposed to a default negation:DefaultNegation
). -
Uses of Invertable in org.tweetyproject.lp.nlp.syntax
Modifier and TypeClassDescriptionclass
A default negation of a first order formula, nested logic programs only allow not quantified formulas.