I-Index

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
All Classes All Packages

I

IaqAcceptabilityReasoner - Class in net.sf.tweety.arg.dung.reasoner: Implements the IAQ approach ("iterative acceptability queries") to determine the set of acceptable arguments of an AF, cf.
IaqAcceptabilityReasoner(AbstractExtensionReasoner, InferenceMode) - Constructor for class net.sf.tweety.arg.dung.reasoner.IaqAcceptabilityReasoner: Creates a new IaqAcceptabilityReasoner.
IcebergInconsistencyExample - Class in net.sf.tweety.logics.pl.examples: Example code for the "iceberg" inconsistency measures as described in [De Bona, Hunter.
IcebergInconsistencyExample() - Constructor for class net.sf.tweety.logics.pl.examples.IcebergInconsistencyExample
IcebergInconsistencyMeasure - Class in net.sf.tweety.logics.pl.analysis: This class implements the inconsistency measures proposed in [De Bona, Hunter.
IcebergInconsistencyMeasure(IcebergInconsistencyMeasure.ConsequenceOperation) - Constructor for class net.sf.tweety.logics.pl.analysis.IcebergInconsistencyMeasure: Creates a new Iceberg Inconsistency Measure with the given consequence operation with default properties.
IcebergInconsistencyMeasure(IcebergInconsistencyMeasure.ConsequenceOperation, boolean) - Constructor for class net.sf.tweety.logics.pl.analysis.IcebergInconsistencyMeasure: Creates a new Iceberg Inconsistency Measure with the given consequence operation.
IcebergInconsistencyMeasure.ConsequenceOperation - Enum in net.sf.tweety.logics.pl.analysis: A consequence operation returns parts of knowledge bases.
id - Variable in enum net.sf.tweety.logics.pl.analysis.InconsistencyMeasureFactory.Measure
id - Variable in enum net.sf.tweety.logics.pl.parser.PlParserFactory.Format
ID - net.sf.tweety.arg.dung.semantics.Semantics
ID - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2Constants: RegularExpression Id.
ID - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2ParserConstants: RegularExpression Id.
ID - Static variable in class net.sf.tweety.web.services.DelpService: The identifier of this service.
ID - Static variable in class net.sf.tweety.web.services.InconsistencyMeasurementService: The identifier of this service.
ID - Static variable in class net.sf.tweety.web.services.PingService: The identifier of this service.
IDEAL_SEMANTICS - Static variable in enum net.sf.tweety.arg.dung.semantics.Semantics
IdealReasoner<T extends Formula> - Class in net.sf.tweety.arg.aba.reasoner: This reasoner for ABA theories performs inference on the ideal extension.
IdealReasoner() - Constructor for class net.sf.tweety.arg.aba.reasoner.IdealReasoner
Identifier() - Method in class net.sf.tweety.lp.asp.parser.ASPCore2Parser
IDENTITY - net.sf.tweety.logics.pl.analysis.IcebergInconsistencyMeasure.ConsequenceOperation
IGNORE_SELFLOOPS - Static variable in interface net.sf.tweety.graphs.Graph: When inverting a graph, ignore self loops (don't add and don't remove)
IllegalCharacterTest() - Method in class net.sf.tweety.logics.pl.test.PlParserTest
ImAdjunctionInvariance - Class in net.sf.tweety.logics.pl.postulates: The "adjunction invariance" postulate for inconsistency measures: The set notation of knowledge bases should be equivalent to the conjunction of its formulas in terms of inconsistency values.
image - Variable in class net.sf.tweety.arg.delp.parser.Token: The string image of the token.
image - Variable in class net.sf.tweety.logics.rpcl.parser.rpclcondensedprobabilitydistributionparser.Token: The string image of the token.
image - Variable in class net.sf.tweety.logics.rpcl.parser.rpclprobabilitydistributionparser.Token: The string image of the token.
image - Variable in class net.sf.tweety.lp.asp.parser.Token: The string image of the token.
image - Variable in class net.sf.tweety.preferences.io.Token: The string image of the token.
ImAttenuation - Class in net.sf.tweety.logics.pl.postulates: The "attenuation" postulate for inconsistency measures: Minimal inconsistent sets of smaller size should have a larger inconsistency value.
ImConsistency - Class in net.sf.tweety.logics.pl.postulates: The "consistency" postulate for inconsistency measures: Consistent knowledge bases receive the minimal inconsistency value (0) and all inconsistent knowledge bases have strictly positive inconsistency values.
ImContradiction - Class in net.sf.tweety.logics.pl.postulates: The "contradiction" postulate for inconsistency measures: A knowledge base is maximally inconsistent if all non-empty subsets are inconsistent.
ImDominance - Class in net.sf.tweety.logics.pl.postulates: The "dominance" postulate for inconsistency measures: Substituting a consistent formula by a weaker formula should not increase the inconsistency value.
ImEqualConflict - Class in net.sf.tweety.logics.pl.postulates: The "equal conflict" postulate for inconsistency measures: Minimal inconsistent subsets of the same size should have the same inconsistency value.
ImExchange - Class in net.sf.tweety.logics.pl.postulates: The "exchange" postulate for inconsistency measures: Exchanging consistent parts of a knowledge base with equivalent ones should not change the inconsistency value.
ImFreeFormulaDilution - Class in net.sf.tweety.logics.pl.postulates: The "free-formula dilution" postulate for inconsistency measures: Removing a formula not participating in any minimal inconsistent set does not make the inconsistency value larger.
ImFreeFormulaIndependence - Class in net.sf.tweety.logics.pl.postulates: The "free-formula independence" postulate for inconsistency measures: Removing a formula not participating in any minimal inconsistent set (= a free formula) does not change the inconsistency value.
ImIrrelevanceOfSyntax - Class in net.sf.tweety.logics.pl.postulates: The "irrelevance of syntax" postulate for inconsistency measures: Knowledge bases with pairwise equivalent formulas should receive the same inconsistency value.
ImMINormalization - Class in net.sf.tweety.logics.pl.postulates: The "MI-normalization" postulate for inconsistency measures: The inconsistency value of any minimal inconsistent subset is 1.
ImMISeparability - Class in net.sf.tweety.logics.pl.postulates: The "MI-separability" postulate for inconsistency measures: The sum of inconsistency values of two knowledge bases with non-interfering sets of minimal inconsistent subsets should be the same as the inconsistency value of their union.
ImMonotony - Class in net.sf.tweety.logics.pl.postulates: The "monotony" postulate for inconsistency measures: Adding information to a belief base cannot decrease the inconsistency value.
ImNormalization - Class in net.sf.tweety.logics.pl.postulates: The "normalization" postulate for inconsistency measures: The inconsistency value is always in the unit interval [0,1], making it possible to compare inconsistency values for knowledge bases of different sizes.
ImPenalty - Class in net.sf.tweety.logics.pl.postulates: The "penalty" postulate for inconsistency measures: Adding a formula that participates in an inconsistency (i.e.
Implication - Class in net.sf.tweety.logics.fol.syntax: The implication of first-order logic.
Implication - Class in net.sf.tweety.logics.pl.syntax: This class models the implication of propositional logic.
Implication(Pair<RelationalFormula, RelationalFormula>) - Constructor for class net.sf.tweety.logics.fol.syntax.Implication: Creates a new implication with the given pair of formulas
Implication(Pair<PlFormula, PlFormula>) - Constructor for class net.sf.tweety.logics.pl.syntax.Implication: Creates a new implication with the given pair of formulas
Implication(RelationalFormula, RelationalFormula) - Constructor for class net.sf.tweety.logics.fol.syntax.Implication: Creates a new implication a=>b with the two given formulas
Implication(PlFormula, PlFormula) - Constructor for class net.sf.tweety.logics.pl.syntax.Implication: Creates a new implication a=>b with the two given formulas
IMPLICATION() - Static method in class net.sf.tweety.logics.commons.LogicalSymbols
ImplicationAcceptanceCondition - Class in net.sf.tweety.arg.adf.syntax.acc
ImplicationAcceptanceCondition(AcceptanceCondition, AcceptanceCondition) - Constructor for class net.sf.tweety.arg.adf.syntax.acc.ImplicationAcceptanceCondition
ImplicationTest() - Method in class net.sf.tweety.logics.fol.test.FolParserTest
ImplicationTest() - Method in class net.sf.tweety.logics.ml.MlReasonerTest
ImplicationTest() - Method in class net.sf.tweety.logics.pl.test.PlParserTest
implies(AcceptanceCondition) - Method in class net.sf.tweety.arg.adf.syntax.acc.AcceptanceCondition.Builder
implSetPredicate(Predicate, Predicate, List<Term<?>>) - Static method in class net.sf.tweety.logics.commons.syntax.interfaces.Atom.AtomImpl
ImPostulate - Class in net.sf.tweety.logics.pl.postulates: An abstract postulate for inconsistency measures in propositional logic; the ancestor of all concrete postulates.
ImPostulate() - Constructor for class net.sf.tweety.logics.pl.postulates.ImPostulate
ImPostulateEvaluationExample - Class in net.sf.tweety.logics.pl.examples: Example code illustrating automatic postulate evaluation of inconsistency measures.
ImPostulateEvaluationExample() - Constructor for class net.sf.tweety.logics.pl.examples.ImPostulateEvaluationExample
ImprovedRiveretTheoryLearner - Class in net.sf.tweety.arg.dung.learning: Implementation of the algorithm for learning (grounded) labelings from with some improvements: Riveret, Régis, and Guido Governatori.
ImprovedRiveretTheoryLearner(Collection<Argument>, int) - Constructor for class net.sf.tweety.arg.dung.learning.ImprovedRiveretTheoryLearner: initialize learner for the given set of arguments
ImSafeFormulaIndependence - Class in net.sf.tweety.logics.pl.postulates: The "safe-formula independence" postulate for inconsistency measures: Removing a safe formula (i.e.
ImSuperAdditivity - Class in net.sf.tweety.logics.pl.postulates: The "super-additivity" postulate for inconsistency measures: The sum of the inconsistency values of two disjoint knowledge bases is not larger than the inconsistency value of the joint knowledge base.
ImWeakDominance - Class in net.sf.tweety.logics.pl.postulates: A weaker variant of the "dominance" postulate using prime implicates, proposed in [Jabbour et al.
IN - net.sf.tweety.arg.dung.semantics.ArgumentStatus
INCDEFAULTVALUE - Static variable in class net.sf.tweety.logics.commons.analysis.streams.EvaluationInconsistencyListener
incise(Collection<Collection<T>>) - Method in interface net.sf.tweety.beliefdynamics.kernels.IncisionFunction: Selects from each collection in the given collection one element and returns the collection of all those elements.
incise(Collection<Collection<T>>) - Method in class net.sf.tweety.beliefdynamics.kernels.RandomIncisionFunction
IncisionFunction<T extends Formula> - Interface in net.sf.tweety.beliefdynamics.kernels: This interface models an incision function for kernel contraction, ie a function that incises each of the kernel sets of some set.
Inclusive - net.sf.tweety.logics.bpm.syntax.GatewayType
INCOMING - net.sf.tweety.arg.adf.reasoner.ordering.ArgumentDegreeOrdering.DegreeType
incomingDegree(Argument) - Method in interface net.sf.tweety.arg.adf.syntax.adf.AbstractDialecticalFramework
incomingDegree(Argument) - Method in class net.sf.tweety.arg.adf.syntax.adf.ExtendedAbstractDialecticalFramework
incomingDegree(Argument) - Method in class net.sf.tweety.arg.adf.syntax.adf.GraphAbstractDialecticalFramework
IncomparableArgumentsTest() - Method in class net.sf.tweety.arg.rankings.RankingsTest
IncompleteConjunctionTest() - Method in class net.sf.tweety.logics.pl.test.PlParserTest
IncompleteDisjunctionTest() - Method in class net.sf.tweety.logics.pl.test.PlParserTest
InconsistencyListener - Interface in net.sf.tweety.logics.commons.analysis.streams: Listener interface for listeners of stream-based inconsistency measures.
inconsistencyMeasure(Collection<ProbabilisticConditional>) - Method in class net.sf.tweety.logics.pcl.analysis.DistanceMinimizationInconsistencyMeasure
inconsistencyMeasure(Collection<ProbabilisticConditional>) - Method in class net.sf.tweety.logics.pcl.analysis.LowerApproxDistanceMinimizationInconsistencyMeasure
inconsistencyMeasure(Collection<ProbabilisticConditional>) - Method in class net.sf.tweety.logics.pcl.analysis.MinimalViolation2InconsistencyMeasure
inconsistencyMeasure(Collection<ProbabilisticConditional>) - Method in class net.sf.tweety.logics.pcl.analysis.MinimalViolationInconsistencyMeasure
inconsistencyMeasure(Collection<ProbabilisticConditional>) - Method in class net.sf.tweety.logics.pcl.analysis.NormalizedDistanceMinimizationInconsistencyMeasure
inconsistencyMeasure(Collection<ProbabilisticConditional>) - Method in class net.sf.tweety.logics.pcl.analysis.NormalizedLowerApproxDistanceMinimizationInconsistencyMeasure
inconsistencyMeasure(Collection<ProbabilisticConditional>) - Method in class net.sf.tweety.logics.pcl.analysis.NormalizedUpperApproxDistanceMinimizationInconsistencyMeasure
inconsistencyMeasure(Collection<ProbabilisticConditional>) - Method in class net.sf.tweety.logics.pcl.analysis.UpperApproxDistanceMinimizationInconsistencyMeasure
inconsistencyMeasure(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.analysis.ContensionInconsistencyMeasure
inconsistencyMeasure(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.analysis.FbInconsistencyMeasure
inconsistencyMeasure(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.analysis.FuzzyInconsistencyMeasure
inconsistencyMeasure(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.analysis.IcebergInconsistencyMeasure
inconsistencyMeasure(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.analysis.MusVarInconsistencyMeasure
inconsistencyMeasure(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.analysis.PmInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure: This method measures the inconsistency of the given set of formulas.
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.CcInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.CspInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.DfInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.DHitInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.DMaxInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.DrasticInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.DSumInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.EtaInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.HsInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.IsInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.MaInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.McscInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.MicInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.MiInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.NConsInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.NormalizedMicInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.NormalizedMiInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.PrInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.streams.DefaultStreamBasedInconsistencyMeasure
inconsistencyMeasure(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.streams.StreamBasedInconsistencyMeasure
inconsistencyMeasure(PartialProbabilityAssignment) - Method in class net.sf.tweety.arg.prob.analysis.PAInconsistencyMeasure
inconsistencyMeasure(BeliefSet<S, ?>) - Method in class net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure
inconsistencyMeasure(Program) - Method in class net.sf.tweety.lp.asp.analysis.PmInconsistencyMeasure
inconsistencyMeasure(Program) - Method in class net.sf.tweety.lp.asp.analysis.SdInconsistencyMeasure
inconsistencyMeasure(T) - Method in class net.sf.tweety.arg.dung.analysis.CycleCountInconsistencyMeasure
inconsistencyMeasure(T) - Method in class net.sf.tweety.arg.dung.analysis.DrasticInconsistencyMeasure
inconsistencyMeasure(T) - Method in interface net.sf.tweety.arg.dung.analysis.InconsistencyMeasure: This method measures the inconsistency of a given Dungian argumentation framework.
inconsistencyMeasure(T) - Method in class net.sf.tweety.arg.dung.analysis.InSumInconsistencyMeasure
inconsistencyMeasure(T) - Method in class net.sf.tweety.arg.dung.analysis.NonGroundedCountInconsistencyMeasure
inconsistencyMeasure(T) - Method in class net.sf.tweety.arg.dung.analysis.PreferredCountInconsistencyMeasure
inconsistencyMeasure(T) - Method in class net.sf.tweety.arg.dung.analysis.UnstableCountInconsistencyMeasure
inconsistencyMeasure(T) - Method in class net.sf.tweety.arg.dung.analysis.WeightedComponentCountInconsistencyMeasure
inconsistencyMeasure(T) - Method in class net.sf.tweety.arg.dung.analysis.WeightedCycleCountInconsistencyMeasure
inconsistencyMeasure(T) - Method in class net.sf.tweety.arg.dung.analysis.WeightedInSumInconsistencyMeasure
inconsistencyMeasure(T) - Method in class net.sf.tweety.arg.dung.analysis.WeightedOutSumInconsistencyMeasure
inconsistencyMeasure(T) - Method in interface net.sf.tweety.logics.commons.analysis.InconsistencyMeasure: This method measures the inconsistency of the given belief base.
InconsistencyMeasure<T extends DungTheory> - Interface in net.sf.tweety.arg.dung.analysis
InconsistencyMeasure<T extends BeliefBase> - Interface in net.sf.tweety.logics.commons.analysis: Classes implementing this interface represent inconsistency measures on belief bases.
InconsistencyMeasureFactory - Class in net.sf.tweety.logics.pl.analysis: Main factory for retrieving inconsistency measures for propositional logic.
InconsistencyMeasureFactory() - Constructor for class net.sf.tweety.logics.pl.analysis.InconsistencyMeasureFactory
InconsistencyMeasureFactory.Measure - Enum in net.sf.tweety.logics.pl.analysis: An enumeration of all available inconsistency measures.
InconsistencyMeasurementProcess<S extends Formula> - Class in net.sf.tweety.logics.commons.analysis.streams: The actual process of an inconsistency measure on streams.
InconsistencyMeasurementProcess() - Constructor for class net.sf.tweety.logics.commons.analysis.streams.InconsistencyMeasurementProcess: Creates a new process for the given stream.
InconsistencyMeasurementService - Class in net.sf.tweety.web.services: Inconsistency measurement service.
InconsistencyMeasurementService() - Constructor for class net.sf.tweety.web.services.InconsistencyMeasurementService: Default constructor
inconsistencyMeasurementStarted(InconsistencyUpdateEvent) - Method in class net.sf.tweety.logics.commons.analysis.streams.DefaultInconsistencyListener
inconsistencyMeasurementStarted(InconsistencyUpdateEvent) - Method in class net.sf.tweety.logics.commons.analysis.streams.EvaluationInconsistencyListener
inconsistencyMeasurementStarted(InconsistencyUpdateEvent) - Method in interface net.sf.tweety.logics.commons.analysis.streams.InconsistencyListener: This method is called by a stream-based inconsistency measure when an inconsistency measurement has started.
InconsistencyUpdateEvent - Class in net.sf.tweety.logics.commons.analysis.streams: An event that is thrown when an inconsistency value has been updated.
InconsistencyUpdateEvent(StreamBasedInconsistencyMeasure<?>, InconsistencyMeasurementProcess<?>, Double, Formula) - Constructor for class net.sf.tweety.logics.commons.analysis.streams.InconsistencyUpdateEvent: Creates a new event with the given parameters.
inconsistencyUpdateOccured(InconsistencyUpdateEvent) - Method in class net.sf.tweety.logics.commons.analysis.streams.DefaultInconsistencyListener
inconsistencyUpdateOccured(InconsistencyUpdateEvent) - Method in class net.sf.tweety.logics.commons.analysis.streams.EvaluationInconsistencyListener
inconsistencyUpdateOccured(InconsistencyUpdateEvent) - Method in interface net.sf.tweety.logics.commons.analysis.streams.InconsistencyListener: This method is called by a stream-based inconsistency measure when an update of an inconsistency value occurs.
INCREASEOFATTACKBRANCH - Static variable in class net.sf.tweety.arg.rankings.postulates.RankingPostulate: The INCREASEOFATTACKBRANCH postulate
INCREASEOFDEFENSEBRANCH - Static variable in class net.sf.tweety.arg.rankings.postulates.RankingPostulate: The INCREASEOFDEFENSEBRANCH postulate
IncreasingSubsetIterator<T> - Class in net.sf.tweety.commons.util: Iterates over all subsets of a given set.
IncreasingSubsetIterator(Set<T>) - Constructor for class net.sf.tweety.commons.util.IncreasingSubsetIterator: Creates a new subset iterator for the given set.
increment(int) - Method in class net.sf.tweety.arg.adf.util.ThreeValuedBitSet: Increments the value at the specified position.
IncrementalSatSolver - Class in net.sf.tweety.arg.adf.sat
IncrementalSatSolver() - Constructor for class net.sf.tweety.arg.adf.sat.IncrementalSatSolver
INDEPENDENCE - Static variable in class net.sf.tweety.arg.rankings.postulates.RankingPostulate: The INDEPENDENCE postulate
independentSets(Set<Collection<E>>, int) - Method in class net.sf.tweety.commons.util.SetTools: Returns all independent sets of the given cardinality of the given set of sets.
INDEX - Static variable in interface net.sf.tweety.preferences.io.UPParserConstants: RegularExpression Id.
indexOf(Object) - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoAssociativeFormula
indexOf(Object) - Method in class net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport
indexOf(Object) - Method in class net.sf.tweety.logics.dl.syntax.AssociativeDlFormula
indexOf(Object) - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
indexOf(Object) - Method in class net.sf.tweety.logics.pl.syntax.AssociativePlFormula
indexOf(Object) - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
IndicatorUtilityFunction - Class in net.sf.tweety.agents.dialogues.structured: This class represents an indicator utility function, i.e.
IndicatorUtilityFunction(Proposition) - Constructor for class net.sf.tweety.agents.dialogues.structured.IndicatorUtilityFunction: Creates a new indicator utility function for the given focal element.
Individual - Class in net.sf.tweety.logics.dl.syntax: This class models an individual in description logic, also known as an object.
Individual(String) - Constructor for class net.sf.tweety.logics.dl.syntax.Individual
Individual(Constant) - Constructor for class net.sf.tweety.logics.dl.syntax.Individual
INEQUALITY() - Static method in class net.sf.tweety.logics.commons.LogicalSymbols
InequalityPredicate - Class in net.sf.tweety.logics.fol.syntax: This class models an inequality predicate, meaning a predicate of arity 2 that maps to the complement of the identity relation.
InequalityPredicate() - Constructor for class net.sf.tweety.logics.fol.syntax.InequalityPredicate
Inequation - Class in net.sf.tweety.math.equation: This class models an inequation of two terms.
Inequation(Term, Term, int) - Constructor for class net.sf.tweety.math.equation.Inequation: Creates a new inequation of the given type with the two terms.
InferenceMode - Enum in net.sf.tweety.commons: Enum constants for the two classical inference models of skeptical inference (assess a formula as true iff it is contained in every model) and credoulous inference (assess a formula as true iff it is contained in some model).
InferenceRule<T extends Formula> - Class in net.sf.tweety.arg.aba.syntax: This class models an inference rule from an ABA theory.
InferenceRule<T extends Invertable> - Class in net.sf.tweety.arg.aspic.syntax
InferenceRule() - Constructor for class net.sf.tweety.arg.aba.syntax.InferenceRule
InferenceRule() - Constructor for class net.sf.tweety.arg.aspic.syntax.InferenceRule: Creates an empty instance
InferenceRule(T, Collection<T>) - Constructor for class net.sf.tweety.arg.aspic.syntax.InferenceRule: Constructs a new inference rule of rule p -> c if strict or p => c else
INFINITY - Static variable in class net.sf.tweety.logics.cl.semantics.RankingFunction: Integer used to define infinity.
INFINITY - Static variable in class net.sf.tweety.logics.rcl.semantics.RelationalRankingFunction: Integer used to define infinity.
INFO - net.sf.tweety.commons.TweetyConfiguration.LogLevel
InformationObject<T extends Formula> - Class in net.sf.tweety.beliefdynamics.mas: This class represents a formula annotated with the source of the formula.
InformationObject(T, Agent) - Constructor for class net.sf.tweety.beliefdynamics.mas.InformationObject: Creates a new information object for the given formula and the given source.
init() - Static method in class net.sf.tweety.arg.delp.TestArguments
init() - Static method in class net.sf.tweety.arg.delp.TestDTree
init() - Static method in class net.sf.tweety.logics.fol.test.Prover9Test
init() - Static method in class net.sf.tweety.logics.fol.test.SPASSTest
init() - Static method in class net.sf.tweety.logics.fol.test.TPTPTest
init() - Method in class net.sf.tweety.logics.ml.MleanCoPTest
init() - Static method in class net.sf.tweety.logics.ml.SPASSTest
init() - Static method in class net.sf.tweety.logics.pl.test.TestNicePossibleWorld
init() - Method in class net.sf.tweety.logics.rdl.test.RDLJUnitTest
init() - Static method in class net.sf.tweety.lp.asp.analysis.AspInconsistencyMeasureTest
init() - Static method in class net.sf.tweety.lp.asp.analysis.ClingoTest
init() - Static method in class net.sf.tweety.lp.asp.analysis.DLVTest
init() - Static method in class net.sf.tweety.lp.asp.parser.ASPCore2ParserTest
initialize(SatSolverState, PropositionalMapping, AbstractDialecticalFramework) - Method in interface net.sf.tweety.arg.adf.reasoner.sat.generator.CandidateGenerator: Performs initializations on the state.
initialize(SatSolverState, PropositionalMapping, AbstractDialecticalFramework) - Method in class net.sf.tweety.arg.adf.reasoner.sat.generator.ConflictFreeGenerator
initialize(SatSolverState, PropositionalMapping, AbstractDialecticalFramework) - Method in class net.sf.tweety.arg.adf.reasoner.sat.generator.GroundGenerator
initialize(SatSolverState, PropositionalMapping, AbstractDialecticalFramework) - Method in class net.sf.tweety.arg.adf.reasoner.sat.generator.ModelGenerator
initializeOrders() - Method in class net.sf.tweety.preferences.test.ScoringPreferenceAggregatorTest
initKB() - Method in class net.sf.tweety.argumentation.parameterisedhierarchy.ArgumentationReasonerTest
initLogging() - Static method in class net.sf.tweety.commons.TweetyLogging: Initialize the logging system.
initParser() - Method in class net.sf.tweety.logics.dl.test.DlParserTest
initParser() - Method in class net.sf.tweety.logics.dl.test.DlReasonerTest
initParser() - Method in class net.sf.tweety.logics.fol.test.FolParserTest
initParser() - Method in class net.sf.tweety.logics.ml.MlParserTest
initParser() - Method in class net.sf.tweety.logics.pl.test.PlParserTest
initParsers() - Static method in class net.sf.tweety.arg.delp.TestFormulaParsing
initTest() - Method in class net.sf.tweety.lp.asp.beliefdynamics.revision.CredibilityTest
initWorld() - Method in class net.sf.tweety.logics.pl.test.TestNicePossibleWorld
INSTANCE - net.sf.tweety.arg.adf.syntax.acc.ContradictionAcceptanceCondition
INSTANCE - net.sf.tweety.arg.adf.syntax.acc.TautologyAcceptanceCondition
InstanceAssignment - Class in net.sf.tweety.logics.rpcl.semantics: Instances of this class represent assignenment of true instances for a given predicate wrt.
InstanceAssignment(Predicate) - Constructor for class net.sf.tweety.logics.rpcl.semantics.InstanceAssignment: Creates a new instance assignment for the given predicate with no assignments.
InstanceAssignment(Predicate, Map<? extends Collection<? extends Constant>, Integer>) - Constructor for class net.sf.tweety.logics.rpcl.semantics.InstanceAssignment: Creates a new instance assignment for the given predicate with the given map.
InstanceAssignment(FolSignature) - Static method in class net.sf.tweety.logics.rpcl.parser.rpclcondensedprobabilitydistributionparser.RpclCondensedProbabilityDistributionParser
instantiate(double) - Method in class net.sf.tweety.machinelearning.TrainingParameter: Instantiates a new parameter with the given value.
instantiate(String) - Method in class net.sf.tweety.plugin.parameter.CommandParameter: instantiate the command with the given argument string if valid
instantiate(String) - Method in class net.sf.tweety.plugin.parameter.CustomStringListCommandParameter: instantiate single string
instantiate(String) - Method in class net.sf.tweety.plugin.parameter.FileListCommandParameter: instantiates a new parameter iff the given value ist valid for this command parameter (for special case with one file);
instantiate(String) - Method in class net.sf.tweety.plugin.parameter.IntegerCommandParameter: instantiates a new parameter iff the given value is valid for this command parameter
instantiate(String) - Method in class net.sf.tweety.plugin.parameter.SelectionCommandParameter: instantiates a new parameter iff the given value ist valid for this command parameter
instantiate(String) - Method in class net.sf.tweety.plugin.parameter.StringListCommandParameter: instantiates unary argument if valid
instantiate(String[]) - Method in class net.sf.tweety.plugin.parameter.CustomStringListCommandParameter: instantiates a list of arguments if valid
instantiate(String[]) - Method in class net.sf.tweety.plugin.parameter.StringListCommandParameter: instantiates a list of arguments if valid
instantiate(ArrayList<String>) - Method in class net.sf.tweety.plugin.parameter.FileListCommandParameter
instantiate(ArrayList<String>) - Method in class net.sf.tweety.plugin.parameter.SelectionCommandParameter
instantiateParameters(TweetyPlugin, ArrayList<ArrayList<String>>) - Static method in class net.sf.tweety.cli.plugins.CliMain: instantiates each given input parameter within the called plugin - if possible
InstantiateVisitor - Class in net.sf.tweety.lp.asp.parser: This visitor iterates over the AST generated by ASPCore2Parser and allocates classes representing the different parts of an ASP program or source file, meaning rules, literals, terms, answer sets, etc.
InstantiateVisitor() - Constructor for class net.sf.tweety.lp.asp.parser.InstantiateVisitor
instantiateWithDefaultValue() - Method in class net.sf.tweety.machinelearning.TrainingParameter: Instantiates a new parameter with the default value.
InSumInconsistencyMeasure<T extends DungTheory> - Class in net.sf.tweety.arg.dung.analysis
InSumInconsistencyMeasure() - Constructor for class net.sf.tweety.arg.dung.analysis.InSumInconsistencyMeasure
inSumWithNoAttackReturnsZero() - Method in class net.sf.tweety.arg.dung.GraphStructureInconsistencyMeasure
inSumWithThreeEdgesReturnsThree() - Method in class net.sf.tweety.arg.dung.GraphStructureInconsistencyMeasure
inSumWorksWithCycles() - Method in class net.sf.tweety.arg.dung.GraphStructureInconsistencyMeasure
IntegerCommandParameter - Class in net.sf.tweety.plugin.parameter: This parameter holds a number-interval of possible arguments
IntegerCommandParameter(String, String) - Constructor for class net.sf.tweety.plugin.parameter.IntegerCommandParameter
IntegerCommandParameter(String, String, String) - Constructor for class net.sf.tweety.plugin.parameter.IntegerCommandParameter
IntegerCommandParameter(String, String, Interval<Integer>) - Constructor for class net.sf.tweety.plugin.parameter.IntegerCommandParameter
IntegerConstant - Class in net.sf.tweety.math.term: This class encapsulates an integer as a term.
IntegerConstant(int) - Constructor for class net.sf.tweety.math.term.IntegerConstant: Creates a new Integer.
integerLinearSolver - Static variable in class net.sf.tweety.web.services.InconsistencyMeasurementService: The integer linear optimization solver configured for this service.
IntegerVariable - Class in net.sf.tweety.math.term: This class models an integer variable as a mathematical term.
IntegerVariable(String) - Constructor for class net.sf.tweety.math.term.IntegerVariable: Creates a new variable with the given name.
IntegerVariable(String, boolean) - Constructor for class net.sf.tweety.math.term.IntegerVariable: Creates a new variable with the given name.
IntegerVariable(String, double, double) - Constructor for class net.sf.tweety.math.term.IntegerVariable: Creates a new variable with the given name and bounds.
IntermediateEvent - Class in net.sf.tweety.logics.bpm.syntax
IntermediateEvent(String) - Constructor for class net.sf.tweety.logics.bpm.syntax.IntermediateEvent
InterpolantEnumerator<S extends Formula> - Interface in net.sf.tweety.logics.commons.analysis: Interface for classes enumerating (Craig) interpolants.
Interpretation - Interface in net.sf.tweety.arg.adf.semantics.interpretation: This class represents a three-valued interpretation of an Abstract Dialectical Framework (ADF).
Interpretation<B extends BeliefBase,S extends Formula> - Interface in net.sf.tweety.commons: An interpretation for some logical language.
Interpretation(FolSignature) - Static method in class net.sf.tweety.logics.rpcl.parser.rpclcondensedprobabilitydistributionparser.RpclCondensedProbabilityDistributionParser
Interpretation.Builder - Class in net.sf.tweety.arg.adf.semantics.interpretation
InterpretationDistance<T extends Interpretation<B,S>,B extends BeliefBase,S extends Formula> - Interface in net.sf.tweety.commons.analysis: Classes implementing this interface represent distance functions between two interpretations.
InterpretationIterator - Class in net.sf.tweety.arg.adf.semantics.interpretation: Creates all possible interpretations while respecting the order of the given arguments.
InterpretationIterator<S extends Formula,B extends BeliefBase,T extends Interpretation<B,S>> - Interface in net.sf.tweety.commons: An iterator over interpretations.
InterpretationIterator(List<Argument>) - Constructor for class net.sf.tweety.arg.adf.semantics.interpretation.InterpretationIterator
InterpretationIteratorTest - Class in net.sf.tweety.arg.adf.util.test
InterpretationIteratorTest() - Constructor for class net.sf.tweety.arg.adf.util.test.InterpretationIteratorTest
InterpretationProcessor - Interface in net.sf.tweety.arg.adf.reasoner.sat.processor: Performs further processing on interpretations, e.g.
InterpretationSet<T extends Formula,B extends BeliefBase,S extends Formula> - Class in net.sf.tweety.commons: This class models an interpretation that is a set of some formula and as such implements the java.util.Collection interface.
InterpretationSet() - Constructor for class net.sf.tweety.commons.InterpretationSet: Creates a new empty interpretation.
InterpretationSet(Collection<? extends T>) - Constructor for class net.sf.tweety.commons.InterpretationSet: Creates a new interpretation with the given collection of formulas.
Intersection - Class in net.sf.tweety.logics.dl.syntax: This class models an intersection in description logics.
Intersection() - Constructor for class net.sf.tweety.logics.dl.syntax.Intersection: Creates a new (empty) intersection.
Intersection(Collection<? extends ComplexConcept>) - Constructor for class net.sf.tweety.logics.dl.syntax.Intersection: Creates a new intersection with the given inner formulas.
Intersection(ComplexConcept, ComplexConcept) - Constructor for class net.sf.tweety.logics.dl.syntax.Intersection: Creates a new intersection with the two given formulae
Interval<S extends java.lang.Number> - Class in net.sf.tweety.math: This class contains a set of closed set (interval) of possible numbers
Interval(NumberSet<S>) - Constructor for class net.sf.tweety.math.Interval
Interval(S, S) - Constructor for class net.sf.tweety.math.Interval
intValue() - Method in class net.sf.tweety.math.ComplexNumber
intValue() - Method in class net.sf.tweety.math.probability.Probability
invalidSignature() - Method in class net.sf.tweety.logics.pl.test.TestNicePossibleWorld
INVERT_SELFLOOPS - Static variable in interface net.sf.tweety.graphs.Graph: When inverting a graph, deal with self loops like ordinary edges (add if not present and remove if present)
Invertable - Interface in net.sf.tweety.logics.commons.syntax.interfaces: Formulas implementing this interface have a complement
invokeExecutable(String) - Static method in class net.sf.tweety.commons.util.NativeShell: Executes the given command on the commandline and returns the complete output.
invokeExecutable(String, long) - Static method in class net.sf.tweety.commons.util.NativeShell
invokeExecutable(String, long, boolean) - Static method in class net.sf.tweety.commons.util.NativeShell: Executes the given command on the commandline and returns the output up to a given number of lines.
InvolutaryPASemantics - Class in net.sf.tweety.arg.prob.semantics: P is involutary wrt.
InvolutaryPASemantics() - Constructor for class net.sf.tweety.arg.prob.semantics.InvolutaryPASemantics
irreducibleHittingSets(Set<Set<E>>) - Method in class net.sf.tweety.commons.util.SetTools: Computes the set of irreducible hitting sets of "sets".
IRRELEVANCEOFSYNTAX - Static variable in class net.sf.tweety.logics.pl.postulates.ImPostulate: The IRRELEVANCEOFSYNTAX postulate
IS - net.sf.tweety.logics.pl.analysis.InconsistencyMeasureFactory.Measure
IS_BETTER - net.sf.tweety.arg.delp.semantics.ComparisonCriterion.Result
IS_EQUAL - net.sf.tweety.arg.delp.semantics.ComparisonCriterion.Result
IS_WORSE - net.sf.tweety.arg.delp.semantics.ComparisonCriterion.Result
isAcceptable(BArgument, Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.AbstractBipolarFramework: checks whether argument is acceptable wrt.
isAcceptable(BArgument, Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.DeductiveArgumentationFramework
isAcceptable(BArgument, Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.EvidentialArgumentationFramework: return true if argument is acceptable with respect to ext argument is acceptable wrt.
isAcceptable(BArgument, Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.NecessityArgumentationFramework: checks whether ext defends argument a set of arguments S defends an argument a iff S u {a} is coherent and S attacks each coherent set T, which attacks a
isAcceptable(DelpArgument, DefeasibleLogicProgram, ComparisonCriterion) - Method in class net.sf.tweety.arg.delp.semantics.DialecticalTree: Checks whether the argumentation line composed of the ancestors of this node and the parameter argument is acceptable given the parameter delp
isAcceptable(Argument, DungTheory) - Method in class net.sf.tweety.arg.dung.semantics.AbstractArgumentationInterpretation: returns true if every attacker on argument is attacked by some accepted argument wrt.
isAdmissable(DungTheory) - Method in class net.sf.tweety.arg.dung.semantics.AbstractArgumentationInterpretation: returns true if every accepted argument of this is defended by some accepted argument wrt.
isAdmissible(AbaExtension<T>) - Method in class net.sf.tweety.arg.aba.syntax.AbaTheory: Checks whether a set of arguments is admissible.
isApplicable(Collection<? extends FolFormula>) - Method in class net.sf.tweety.arg.delp.syntax.DelpRule: Checks whether this rule is applicaple in the given context literals,
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaAbstraction
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaAdditionOfAttackBranch
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaAdditionOfDefenseBranch
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaAttackVsFullDefense
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaCardinalityPrecedence
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaCounterTransitivity
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaDefensePrecedence
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaDistDefensePrecedence
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaIncreaseOfAttackBranch
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaIncreaseOfDefenseBranch
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaIndependence
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RankingPostulate
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaNonAttackedEquivalence
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaQualityPrecedence
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaSelfContradiction
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaStrictAdditionOfDefenseBranch
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaStrictCounterTransitivity
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaTotal
isApplicable(Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RaVoidPrecedence
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImAdjunctionInvariance
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImAttenuation
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImConsistency
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImContradiction
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImDominance
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImEqualConflict
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImExchange
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImFreeFormulaDilution
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImFreeFormulaIndependence
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImIrrelevanceOfSyntax
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImMINormalization
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImMISeparability
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImMonotony
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImNormalization
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImPenalty
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImPostulate
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImSafeFormulaIndependence
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImSuperAdditivity
isApplicable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImWeakDominance
isApplicable(Collection<S>) - Method in interface net.sf.tweety.commons.postulates.Postulate: Checks whether the given kb represents a non-trivial instance for this postulate, i.e., whether assumptions of this postulates are satisfied (evaluating an approach on a non-applicable instance always succeeds).
isApplicable(DefaultRule) - Method in class net.sf.tweety.logics.rdl.semantics.DefaultSequence: applicable ^= pre in In and (not jus_i) not in In forall i
isAssumption() - Method in class net.sf.tweety.arg.aba.syntax.AbaRule
isAssumption() - Method in class net.sf.tweety.arg.aba.syntax.Assumption
isAssumption() - Method in class net.sf.tweety.arg.aba.syntax.InferenceRule
isAtomic() - Method in class net.sf.tweety.logics.dl.syntax.AssertionalAxiom
isAtomic() - Method in class net.sf.tweety.logics.dl.syntax.ConceptAssertion
isAtomic() - Method in class net.sf.tweety.logics.dl.syntax.RoleAssertion
isAttack(AspicArgument<T>, AspicArgument<T>, RuleFormulaGenerator<T>, Comparator<AspicArgument<T>>) - Static method in class net.sf.tweety.arg.aspic.semantics.AspicAttack: Determines whether the attack is successful
isAttack(AspicArgument<T>, AspicArgument<T>, RuleFormulaGenerator<T>, Comparator<AspicArgument<T>>) - Static method in class net.sf.tweety.arg.aspic.syntax.AspicArgument: Determines whether the attack is successful
isAttackBranch(Argument, Argument) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: Checks whether the path from b to a is an attack branch, i.e.
isAttacked(BArgument, Set<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.DeductiveArgumentationFramework: returns true if some argument of argumentSet attacks argument.
isAttacked(Extension, Extension) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: returns true if some argument of ext2 attacks some argument in ext1
isAttacked(Argument, Extension) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: returns true if some argument of ext attacks argument.
isAttackedBy(Collection<BArgument>, Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.NecessityArgumentationFramework: checks whether some argument in argumentSet1 is attacked by any argument in argumentSet2
isAttackedBy(BArgument, Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.NecessityArgumentationFramework: checks whether argument is attacked by any argument in argumentSet
isAttackedBy(BArgument, BipolarEntity) - Method in class net.sf.tweety.arg.bipolar.syntax.AbstractBipolarFramework: Checks whether arg1 is attacked by arg2.
isAttackedBy(DeductiveArgument, DeductiveArgument) - Method in interface net.sf.tweety.arg.deductive.semantics.attacks.Attack: Returns "true" iff the first argument is attacked by the second argument.
isAttackedBy(DeductiveArgument, DeductiveArgument) - Method in class net.sf.tweety.arg.deductive.semantics.attacks.CanonicalUndercut
isAttackedBy(DeductiveArgument, DeductiveArgument) - Method in class net.sf.tweety.arg.deductive.semantics.attacks.Defeat
isAttackedBy(DeductiveArgument, DeductiveArgument) - Method in class net.sf.tweety.arg.deductive.semantics.attacks.DefeatingRebuttal
isAttackedBy(DeductiveArgument, DeductiveArgument) - Method in class net.sf.tweety.arg.deductive.semantics.attacks.DirectDefeat
isAttackedBy(DeductiveArgument, DeductiveArgument) - Method in class net.sf.tweety.arg.deductive.semantics.attacks.DirectUndercut
isAttackedBy(DeductiveArgument, DeductiveArgument) - Method in class net.sf.tweety.arg.deductive.semantics.attacks.Rebuttal
isAttackedBy(DeductiveArgument, DeductiveArgument) - Method in class net.sf.tweety.arg.deductive.semantics.attacks.Undercut
isAttackedBy(Argument, Collection<Argument>) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: returns true if some argument of ext is attacked by argument.
isAttackedBy(Argument, Argument) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: Checks whether arg1 is attacked by arg2.
isAttackedBy(Argument, Argument) - Method in class net.sf.tweety.arg.saf.syntax.StructuredArgumentationFramework
isAttacking() - Method in enum net.sf.tweety.arg.adf.semantics.link.LinkType
isAttacking(Set<BArgument>, Set<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.DeductiveArgumentationFramework: Checks whether argumentSet1 is attacking argumentSet2 ie any element of argumentSet1 is attacking any element of argumentSet2
isAttacking(BArgument, Set<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.DeductiveArgumentationFramework: returns true if some argument of argSet is attacked by argument.
isAttackingAllOtherArguments(Extension) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: returns true if arguments attack all other arguments in the theory
isBipolar() - Method in enum net.sf.tweety.arg.adf.semantics.link.LinkType
isClause() - Method in class net.sf.tweety.logics.pl.syntax.Disjunction
isClause() - Method in class net.sf.tweety.logics.pl.syntax.ExclusiveDisjunction
isClause() - Method in class net.sf.tweety.logics.pl.syntax.PlFormula: Checks whether this formula is a clause, i.e.
isClosed() - Method in class net.sf.tweety.arg.delp.syntax.DelpRule
isClosed() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormula: Checks whether this formula is closed, i.e.
isClosed() - Method in class net.sf.tweety.logics.commons.syntax.QuantifiedFormulaSupport
isClosed() - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
isClosed() - Method in class net.sf.tweety.logics.fol.syntax.Equivalence
isClosed() - Method in class net.sf.tweety.logics.fol.syntax.ExistsQuantifiedFormula
isClosed() - Method in class net.sf.tweety.logics.fol.syntax.FolAtom
isClosed() - Method in class net.sf.tweety.logics.fol.syntax.ForallQuantifiedFormula
isClosed() - Method in class net.sf.tweety.logics.fol.syntax.Implication
isClosed() - Method in class net.sf.tweety.logics.fol.syntax.Negation
isClosed() - Method in class net.sf.tweety.logics.fol.syntax.SpecialFormula
isClosed() - Method in class net.sf.tweety.logics.ml.syntax.MlFormula
isClosed() - Method in class net.sf.tweety.logics.mln.syntax.MlnFormula
isClosed() - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional
isClosed() - Method in class net.sf.tweety.logics.rdl.syntax.DefaultRule
isClosed() - Method in class net.sf.tweety.lp.nlp.syntax.NLPNot
isClosed(Collection<Assumption<T>>) - Method in class net.sf.tweety.arg.aba.syntax.AbaTheory: A set of assumptions is closed iff it equals its closure.
isClosed(Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.NecessityArgumentationFramework: checks if the given set of arguments is closed under the support relation a set of arguments S is closed iff every argument a in S has support from a non-empty subset of S
isClosed(Set<Variable>) - Method in class net.sf.tweety.arg.delp.syntax.DelpRule
isClosed(Set<Variable>) - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormula: Checks whether this formula is closed, i.e.
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.commons.syntax.QuantifiedFormulaSupport
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.Equivalence
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.ExistsQuantifiedFormula
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.FolAtom
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.ForallQuantifiedFormula
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.Implication
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.Negation
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.SpecialFormula
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.ml.syntax.MlFormula
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.mln.syntax.MlnFormula
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional
isClosed(Set<Variable>) - Method in class net.sf.tweety.logics.rdl.syntax.DefaultRule
isClosed(Set<Variable>) - Method in class net.sf.tweety.lp.nlp.syntax.NLPNot
isClosed(ArgumentSet) - Method in class net.sf.tweety.arg.bipolar.syntax.DeductiveArgumentationFramework: Determines if ext is closed under the support relation of this framework i.e., if all arguments supported by ext are an element of ext
isClosed(DefaultTheory) - Method in class net.sf.tweety.logics.rdl.semantics.DefaultSequence: Tests wether all applicble defaukts from t have been applied
isCoherent() - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: Determines if the theory is coherent, i.e., if each preferred extension is stable
isCoherent(Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.NecessityArgumentationFramework: checks if the set of arguments S is coherent in his argumentation framework S is coherent iff it is closed and N-Cycle-Free
isComparable(T, T) - Method in class net.sf.tweety.graphs.orders.Order
isComplete() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoArgument
isComplete() - Method in class net.sf.tweety.logics.commons.syntax.FunctionalTerm: Checks whether this term is complete, i.e.
isComplete() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.Atom
isComplete() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.TypedStructure
isComplete() - Method in class net.sf.tweety.logics.commons.syntax.TypedStructureAdapter
isComplete() - Method in class net.sf.tweety.logics.fol.syntax.FolAtom: Checks whether this atom is complete, i.e.
isComplete() - Method in class net.sf.tweety.logics.pl.syntax.Proposition
isComplete() - Method in class net.sf.tweety.lp.asp.syntax.ASPAtom
isComplete() - Method in class net.sf.tweety.lp.asp.syntax.StrictNegation
isCompliant(ProbabilisticExtension) - Method in class net.sf.tweety.arg.prob.syntax.PartialProbabilityAssignment: Checks whether the given probabilistic extension is compliant with this partial probability assignment, i.e.
isConflictFree(Collection<? extends Argument>) - Method in class net.sf.tweety.arg.dung.syntax.Attack: returns true if one arguments in arguments attacks another within this attack relation.
isConflictFree(Collection<Assumption<T>>) - Method in class net.sf.tweety.arg.aba.syntax.AbaTheory: Checks whether a set of arguments is conflict-free.
isConflictFree(Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.NecessityArgumentationFramework: checks whether the given set is conflict-free wrt.
isConflictFree(DungTheory) - Method in class net.sf.tweety.arg.dung.semantics.AbstractArgumentationInterpretation: returns true if no accepted argument attacks another accepted one in this interpretation wrt.
isCongruent(Labeling) - Method in class net.sf.tweety.arg.prob.semantics.ProbabilisticExtension: Checks whether the given labeling is congruent to this probabilistic extension, i.e.
isConjunctiveClause() - Method in class net.sf.tweety.logics.pl.syntax.Conjunction
isConjunctiveClause() - Method in class net.sf.tweety.logics.pl.syntax.PlFormula: Checks whether this formula is a conjunctive clause, i.e.
isConsistent(Collection<ProbabilisticConditional>) - Method in class net.sf.tweety.logics.pcl.analysis.PclDefaultConsistencyTester
isConsistent(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.sat.SatSolver
isConsistent(Collection<PlFormula>) - Method in class net.sf.tweety.logics.qbf.reasoner.QbfSolver
isConsistent(Collection<S>) - Method in class net.sf.tweety.logics.commons.analysis.AbstractMusEnumerator
isConsistent(Collection<S>) - Method in interface net.sf.tweety.logics.commons.analysis.MusEnumerator
isConsistent(Collection<T>) - Method in class net.sf.tweety.logics.commons.analysis.AbstractBeliefSetConsistencyTester
isConsistent(Collection<T>) - Method in interface net.sf.tweety.logics.commons.analysis.BeliefSetConsistencyTester: Checks whether the given collection of formulas is consistent.
isConsistent(Set<DefeasibleRule>) - Method in class net.sf.tweety.arg.delp.syntax.DefeasibleLogicProgram: Checks whether the given set of defeasible rules are consistent given the strict part of this program.
isConsistent(ActionDescription<CLaw>) - Method in class net.sf.tweety.action.description.analysis.CActionDescriptionConsistencyTester
isConsistent(ActionDescription<T>) - Method in interface net.sf.tweety.action.description.analysis.ActionDescriptionConsistencyTester: Checks whether the given set of causal rules is consistent.
isConsistent(CActionDescription) - Method in class net.sf.tweety.action.description.analysis.CActionDescriptionConsistencyTester: Checks, whether the given action description in the action language C is consistent.
isConsistent(BeliefSet<PlFormula, ?>) - Method in class net.sf.tweety.logics.pl.sat.SatSolver
isConsistent(BeliefSet<PlFormula, ?>) - Method in class net.sf.tweety.logics.qbf.reasoner.QbfSolver
isConsistent(BeliefSet<S, ?>) - Method in class net.sf.tweety.logics.commons.analysis.AbstractMusEnumerator
isConsistent(BeliefSet<S, ?>) - Method in interface net.sf.tweety.logics.commons.analysis.MusEnumerator
isConsistent(BeliefSet<T, ?>) - Method in class net.sf.tweety.logics.commons.analysis.AbstractBeliefSetConsistencyTester
isConsistent(BeliefSet<T, ?>) - Method in interface net.sf.tweety.logics.commons.analysis.BeliefSetConsistencyTester
isConsistent(ProbabilisticConditional) - Method in class net.sf.tweety.logics.pcl.analysis.PclDefaultConsistencyTester
isConsistent(PlFormula) - Method in class net.sf.tweety.logics.pl.sat.SatSolver
isConsistent(PlFormula) - Method in class net.sf.tweety.logics.qbf.reasoner.QbfSolver
isConsistent(S) - Method in class net.sf.tweety.logics.commons.analysis.AbstractMusEnumerator
isConsistent(S) - Method in interface net.sf.tweety.logics.commons.analysis.MusEnumerator
isConsistent(T) - Method in class net.sf.tweety.logics.commons.analysis.AbstractBeliefSetConsistencyTester
isConsistent(T) - Method in interface net.sf.tweety.logics.commons.analysis.BeliefSetConsistencyTester: Checks whether the given formula is consistent.
isConsistent(T) - Method in interface net.sf.tweety.logics.commons.analysis.ConsistencyTester: Checks whether the given belief base is consistent.
isConstraint() - Method in class net.sf.tweety.arg.aba.syntax.Assumption
isConstraint() - Method in class net.sf.tweety.arg.aba.syntax.InferenceRule
isConstraint() - Method in class net.sf.tweety.arg.aspic.syntax.InferenceRule
isConstraint() - Method in class net.sf.tweety.arg.deductive.syntax.SimplePlRule
isConstraint() - Method in class net.sf.tweety.arg.delp.syntax.DelpRule
isConstraint() - Method in class net.sf.tweety.arg.saf.syntax.BasicArgument
isConstraint() - Method in interface net.sf.tweety.commons.util.rules.Rule
isConstraint() - Method in class net.sf.tweety.logics.cl.syntax.Conditional
isConstraint() - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional
isConstraint() - Method in class net.sf.tweety.lp.asp.syntax.ASPRule
isConstraint() - Method in class net.sf.tweety.lp.nlp.syntax.NLPRule
isContinuous() - Method in class net.sf.tweety.math.term.Term: Checks whether this term is continuous in all appearing variables.
isContinuous(Variable) - Method in class net.sf.tweety.math.term.AbsoluteValue
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Constant
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Difference
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Exp
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Fraction
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Logarithm
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Maximum
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Minimum
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Power
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Product
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Root
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Sum
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Term: Checks whether this term is continuous in v.
isContinuous(Variable) - Method in class net.sf.tweety.math.term.Variable
isDefeasible() - Method in class net.sf.tweety.arg.aspic.syntax.DefeasibleInferenceRule
isDefeasible() - Method in class net.sf.tweety.arg.aspic.syntax.InferenceRule
isDefeasible() - Method in class net.sf.tweety.arg.aspic.syntax.StrictInferenceRule
isDefenseBranch(Argument, Argument) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: Checks whether the path from b to a is a defense branch, i.e.
isDefensible(ArgumentationKnowledgeBase, Argument) - Method in class net.sf.tweety.arg.lp.reasoner.ArgumentationReasoner: An argument is called x/y-defensible if it is neither x/y-justified nor x/y-overruled.
isDefinite() - Method in class net.sf.tweety.action.description.syntax.CActionDescription: Checks whether this action description contains any non-definite laws.
isDefinite() - Method in class net.sf.tweety.action.description.syntax.CLaw: Returns true iff this law is definite.
isDefinite() - Method in class net.sf.tweety.action.description.syntax.DynamicLaw
isDefinite() - Method in class net.sf.tweety.action.description.syntax.StaticLaw
isDependent() - Method in enum net.sf.tweety.arg.adf.semantics.link.LinkType
isDirectSupportedBy(BArgument, BipolarEntity) - Method in class net.sf.tweety.arg.bipolar.syntax.AbstractBipolarFramework: Checks whether arg1 is directly supported by arg2.
isDisjoint(Collection<Division>, DungTheory, Semantics) - Static method in class net.sf.tweety.arg.dung.divisions.Division: Checks whether the given set o divisions is disjoint wrt.
isDnf() - Method in class net.sf.tweety.logics.commons.syntax.QuantifiedFormulaSupport
isDnf() - Method in class net.sf.tweety.logics.fol.syntax.Conjunction
isDnf() - Method in class net.sf.tweety.logics.fol.syntax.Disjunction
isDnf() - Method in class net.sf.tweety.logics.fol.syntax.Equivalence
isDnf() - Method in class net.sf.tweety.logics.fol.syntax.ExclusiveDisjunction
isDnf() - Method in class net.sf.tweety.logics.fol.syntax.ExistsQuantifiedFormula
isDnf() - Method in class net.sf.tweety.logics.fol.syntax.FolAtom
isDnf() - Method in class net.sf.tweety.logics.fol.syntax.FolFormula: Checks whether this formula is in disjunctive normal form.
isDnf() - Method in class net.sf.tweety.logics.fol.syntax.ForallQuantifiedFormula
isDnf() - Method in class net.sf.tweety.logics.fol.syntax.Implication
isDnf() - Method in class net.sf.tweety.logics.fol.syntax.Negation
isDnf() - Method in class net.sf.tweety.logics.fol.syntax.SpecialFormula
isDnf() - Method in class net.sf.tweety.logics.ml.syntax.Necessity
isDnf() - Method in class net.sf.tweety.logics.ml.syntax.Possibility
isDnf() - Method in class net.sf.tweety.lp.nlp.syntax.NLPNot
isElementOf(S) - Method in class net.sf.tweety.math.Interval: checks, whether an element is within this interval
isEmpty() - Method in class net.sf.tweety.agents.MultiAgentSystem
isEmpty() - Method in class net.sf.tweety.arg.aba.semantics.AbaExtension
isEmpty() - Method in class net.sf.tweety.arg.adf.util.CacheMap
isEmpty() - Method in class net.sf.tweety.arg.adf.util.LazyMap
isEmpty() - Method in class net.sf.tweety.arg.adf.util.MinusSetView
isEmpty() - Method in class net.sf.tweety.arg.adf.util.UnionSetView
isEmpty() - Method in class net.sf.tweety.arg.bipolar.syntax.ArgumentSet
isEmpty() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoAssociativeFormula
isEmpty() - Method in class net.sf.tweety.arg.dung.semantics.Extension
isEmpty() - Method in class net.sf.tweety.arg.dung.semantics.Labeling
isEmpty() - Method in class net.sf.tweety.arg.dung.semantics.StratifiedLabeling
isEmpty() - Method in class net.sf.tweety.arg.rankings.semantics.NumericalArgumentRanking
isEmpty() - Method in class net.sf.tweety.arg.saf.syntax.ArgumentStructure
isEmpty() - Method in class net.sf.tweety.commons.BeliefSet
isEmpty() - Method in class net.sf.tweety.commons.DualSetSignature
isEmpty() - Method in class net.sf.tweety.commons.InterpretationSet
isEmpty() - Method in class net.sf.tweety.commons.QuadrupleSetSignature
isEmpty() - Method in interface net.sf.tweety.commons.Signature: Returns true if this signature is empty.
isEmpty() - Method in class net.sf.tweety.commons.SingleSetSignature
isEmpty() - Method in class net.sf.tweety.commons.TripleSetSignature
isEmpty() - Method in class net.sf.tweety.logics.bpm.syntax.BpmnSignature
isEmpty() - Method in class net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport
isEmpty() - Method in class net.sf.tweety.logics.dl.syntax.AssociativeDlFormula
isEmpty() - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
isEmpty() - Method in class net.sf.tweety.logics.pcl.semantics.ProbabilityDistribution
isEmpty() - Method in class net.sf.tweety.logics.pl.semantics.FuzzyInterpretation
isEmpty() - Method in class net.sf.tweety.logics.pl.syntax.AssociativePlFormula
isEmpty() - Method in class net.sf.tweety.logics.rdl.semantics.Extension
isEmpty() - Method in class net.sf.tweety.logics.rpcl.semantics.ReferenceWorld
isEmpty() - Method in class net.sf.tweety.logics.rpcl.semantics.RpclProbabilityDistribution
isEmpty() - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
isEmpty() - Method in class net.sf.tweety.lp.asp.syntax.ASPRule
isEmpty() - Method in class net.sf.tweety.math.Interval
isEmpty() - Method in class net.sf.tweety.math.probability.ProbabilityFunction
isEmpty() - Method in class net.sf.tweety.preferences.PreferenceOrder: returns whether the set is empty or not
isEmpty() - Method in class net.sf.tweety.preferences.update.UpdateStream
isEquallyAcceptableThan(Argument, Argument) - Method in class net.sf.tweety.arg.rankings.semantics.ArgumentRanking: Returns "true" iff a is equally acceptable as b, i.e.
isEquivalent(ArgumentRanking, Collection<Argument>) - Method in class net.sf.tweety.arg.rankings.semantics.ArgumentRanking: Checks whether this ranking is equivalent to the other one wrt.
isEquivalent(PlFormula, PlFormula) - Method in class net.sf.tweety.logics.pl.reasoner.AbstractPlReasoner: Checks whether the two formulas are equivalent
isEvidenceSupportedAttack(Collection<BArgument>, BArgument) - Method in class net.sf.tweety.arg.bipolar.syntax.EvidentialArgumentationFramework: returns true if ext carries out an evidence supported attack on argument ext e-support-attacks an argument a iff a subset S of ext attacks a and all elements of S have e-support from ext.
isExhaustive(Collection<Division>, DungTheory, Semantics) - Static method in class net.sf.tweety.arg.dung.divisions.Division: Checks whether the given set of divisions is exhaustive wrt.
isExtendedProgram() - Method in class net.sf.tweety.lp.asp.syntax.Program: Checks if the program is an extended program, meaning the heads of the literals do not have more than one literal.
isFact() - Method in class net.sf.tweety.arg.aba.syntax.Assumption
isFact() - Method in class net.sf.tweety.arg.aba.syntax.InferenceRule
isFact() - Method in class net.sf.tweety.arg.aspic.syntax.InferenceRule
isFact() - Method in class net.sf.tweety.arg.deductive.syntax.SimplePlRule
isFact() - Method in class net.sf.tweety.arg.delp.syntax.DelpRule
isFact() - Method in class net.sf.tweety.arg.saf.syntax.BasicArgument
isFact() - Method in interface net.sf.tweety.commons.util.rules.Rule
isFact() - Method in class net.sf.tweety.logics.cl.syntax.Conditional: Checks whether this conditional is a fact, i.e.
isFact() - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional: Checks whether this conditional is a fact, i.e.
isFact() - Method in class net.sf.tweety.lp.asp.syntax.ASPRule
isFact() - Method in class net.sf.tweety.lp.nlp.syntax.NLPRule
isFinite() - Method in class net.sf.tweety.math.matrix.Matrix: Checks whether each entry in this matrix describes a finite number.
isFirm() - Method in class net.sf.tweety.arg.aspic.syntax.AspicArgument: An argument is firm iff it does not contain ordinary premises
isFlat() - Method in class net.sf.tweety.arg.aba.syntax.AbaTheory: An ABA theory is flat iff all subsets of its argumentation set are closed
isFounded() - Method in class net.sf.tweety.commons.util.rules.Derivation: Checks whether this derivation is founded, i.e.
isGround() - Method in class net.sf.tweety.action.description.syntax.CActionDescription: Checks whether this action description contains any non-ground laws.
isGround() - Method in class net.sf.tweety.action.description.syntax.CLaw
isGround() - Method in class net.sf.tweety.action.signature.FolAction: Checks whether this action is ground or not.
isGround() - Method in class net.sf.tweety.arg.aba.syntax.AbaElement
isGround() - Method in class net.sf.tweety.arg.aspic.syntax.InferenceRule
isGround() - Method in class net.sf.tweety.arg.delp.syntax.DefeasibleLogicProgram
isGround() - Method in class net.sf.tweety.arg.delp.syntax.DelpRule: Checks whether there appear any variables in this rule
isGround() - Method in class net.sf.tweety.logics.commons.syntax.ComplexLogicalFormulaAdapter
isGround() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.ComplexLogicalFormula: Checks whether this formula is ground, i.e.
isGround() - Method in class net.sf.tweety.logics.commons.syntax.RelationalFormula: Checks whether this formula is ground, i.e.
isGround() - Method in class net.sf.tweety.lp.asp.syntax.ASPElement
isGround() - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
isGround() - Method in class net.sf.tweety.lp.asp.syntax.ASPRule
isGround() - Method in class net.sf.tweety.lp.asp.syntax.Program
isIncomparable(Argument, Argument) - Method in class net.sf.tweety.arg.rankings.semantics.ArgumentRanking: Returns "true" iff a and b are incomparable (i.e.
isIncomparable(Argument, Argument) - Method in class net.sf.tweety.arg.rankings.semantics.LatticeArgumentRanking
isIncomparable(Argument, Argument) - Method in class net.sf.tweety.arg.rankings.semantics.NumericalArgumentRanking
IsInconsistencyMeasure<S extends Formula> - Class in net.sf.tweety.logics.commons.analysis: This class implements the inconsistency measure I_CSP from [Said Jabbour.
IsInconsistencyMeasure(MusEnumerator<S>) - Constructor for class net.sf.tweety.logics.commons.analysis.IsInconsistencyMeasure: Creates a new measure that uses the given MUS enumerator.
isIndependent(Set<Collection<E>>) - Method in class net.sf.tweety.commons.util.SetTools: Checks whether the given set of sets is independent, i.e.
isIndirectAttack(Argument, Argument) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: Checks whether "arg1" indirectly attacks "arg2", i.e.
isInjective(Map<? extends Object, ? extends Object>) - Static method in class net.sf.tweety.commons.util.MapTools: Checks whether the given map is injective, i.e.
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.ApacheCommonsCMAESOptimizer
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.ApacheCommonsNonLinearConjugateGradientOptimizer
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.ApacheCommonsSimplex
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.BfgsSolver
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.GlpkSolver
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.GradientDescent
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.HessianGradientDescent
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.LagrangeSolver
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.LpSolve
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.OctaveSqpSolver
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.SimpleGeneticOptimizationSolver
isInstalled() - Static method in class net.sf.tweety.math.opt.solver.Solver: Checks whether the solver of this class is actually installed, i.e.
isInteger() - Method in class net.sf.tweety.math.opt.problem.ConstraintSatisfactionProblem: Checks whether this problem is integer, i.e.
isInteger() - Method in class net.sf.tweety.math.term.AssociativeOperation
isInteger() - Method in class net.sf.tweety.math.term.BinaryVariable
isInteger() - Method in class net.sf.tweety.math.term.Difference
isInteger() - Method in class net.sf.tweety.math.term.FloatConstant
isInteger() - Method in class net.sf.tweety.math.term.FloatVariable
isInteger() - Method in class net.sf.tweety.math.term.Fraction
isInteger() - Method in class net.sf.tweety.math.term.FunctionalTerm
isInteger() - Method in class net.sf.tweety.math.term.IntegerConstant
isInteger() - Method in class net.sf.tweety.math.term.IntegerVariable
isInteger() - Method in class net.sf.tweety.math.term.Term: Checks whether this term represents an integer value.
isInterpolant(PlFormula, Collection<PlFormula>, Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.analysis.SimplePlInterpolantEnumerator
isInterpolant(S, Collection<S>, Collection<S>) - Method in interface net.sf.tweety.logics.commons.analysis.InterpolantEnumerator: Checks whether the given formula "candidate" is an interpolant of k1 wrt.
isIsomorphic(Graph<? extends Node>, Graph<? extends Node>) - Static method in class net.sf.tweety.graphs.util.GraphUtil: Checks whether the two graphs are isomorphic.
isJustificationProblem() - Method in enum net.sf.tweety.arg.dung.reasoner.ProboProblem
isJustificationProblem() - Method in enum net.sf.tweety.arg.dung.reasoner.ProboProblem.SubProblem
isJustified(ArgumentationKnowledgeBase, ASPLiteral) - Method in class net.sf.tweety.arg.lp.reasoner.LiteralReasoner: A literal is called x/y-justified, if a x/y-justified argument with conclusion arg can be constructed from p.
isLinear() - Method in class net.sf.tweety.math.opt.problem.ConstraintSatisfactionProblem: Checks whether every constraint of this problem is linear.
isLinear() - Method in class net.sf.tweety.math.opt.problem.OptimizationProblem
isLinear() - Method in class net.sf.tweety.math.term.Term: Checks whether this term is linear.
isLiteral() - Method in class net.sf.tweety.arg.aba.syntax.AbaElement
isLiteral() - Method in class net.sf.tweety.arg.aba.syntax.Assumption
isLiteral() - Method in class net.sf.tweety.arg.aspic.syntax.InferenceRule
isLiteral() - Method in class net.sf.tweety.arg.delp.syntax.DelpRule
isLiteral() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoArgument
isLiteral() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoFormula
isLiteral() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoNegation
isLiteral() - Method in class net.sf.tweety.logics.cl.syntax.Conditional
isLiteral() - Method in class net.sf.tweety.logics.commons.syntax.ComplexLogicalFormulaAdapter
isLiteral() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula
isLiteral() - Method in class net.sf.tweety.logics.commons.syntax.QuantifiedFormulaSupport
isLiteral() - Method in class net.sf.tweety.logics.dl.syntax.AssociativeDlFormula
isLiteral() - Method in class net.sf.tweety.logics.dl.syntax.AtomicConcept
isLiteral() - Method in class net.sf.tweety.logics.dl.syntax.AtomicRole
isLiteral() - Method in class net.sf.tweety.logics.dl.syntax.BottomConcept
isLiteral() - Method in class net.sf.tweety.logics.dl.syntax.Complement
isLiteral() - Method in class net.sf.tweety.logics.dl.syntax.DlAxiom
isLiteral() - Method in class net.sf.tweety.logics.dl.syntax.EquivalenceAxiom
isLiteral() - Method in class net.sf.tweety.logics.dl.syntax.ExistentialRestriction
isLiteral() - Method in class net.sf.tweety.logics.dl.syntax.TopConcept
isLiteral() - Method in class net.sf.tweety.logics.dl.syntax.UniversalRestriction
isLiteral() - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
isLiteral() - Method in class net.sf.tweety.logics.fol.syntax.Equivalence
isLiteral() - Method in class net.sf.tweety.logics.fol.syntax.ExistsQuantifiedFormula
isLiteral() - Method in class net.sf.tweety.logics.fol.syntax.FolAtom
isLiteral() - Method in class net.sf.tweety.logics.fol.syntax.ForallQuantifiedFormula
isLiteral() - Method in class net.sf.tweety.logics.fol.syntax.Implication
isLiteral() - Method in class net.sf.tweety.logics.fol.syntax.Negation
isLiteral() - Method in class net.sf.tweety.logics.fol.syntax.SpecialFormula
isLiteral() - Method in class net.sf.tweety.logics.ml.syntax.MlFormula
isLiteral() - Method in class net.sf.tweety.logics.mln.syntax.MlnFormula
isLiteral() - Method in class net.sf.tweety.logics.pl.syntax.Negation
isLiteral() - Method in class net.sf.tweety.logics.pl.syntax.PlFormula
isLiteral() - Method in class net.sf.tweety.logics.pl.syntax.Proposition
isLiteral() - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional
isLiteral() - Method in class net.sf.tweety.logics.rdl.syntax.DefaultRule
isLiteral() - Method in class net.sf.tweety.lp.asp.syntax.AggregateAtom
isLiteral() - Method in class net.sf.tweety.lp.asp.syntax.AggregateElement
isLiteral() - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
isLiteral() - Method in class net.sf.tweety.lp.asp.syntax.ASPLiteral
isLiteral() - Method in class net.sf.tweety.lp.asp.syntax.ASPRule
isLiteral() - Method in class net.sf.tweety.lp.asp.syntax.ComparativeAtom
isLiteral() - Method in class net.sf.tweety.lp.asp.syntax.DefaultNegation
isLiteral() - Method in class net.sf.tweety.lp.nlp.syntax.NLPNot
isMappedToTrue(FolAtom) - Method in class net.sf.tweety.action.transitionsystem.State: Returns true iff the fluent given is mapped to true by this state.
isMConflictFree(DungTheory, Collection<Argument>, int) - Method in class net.sf.tweety.arg.rankings.reasoner.IteratedGradedDefenseReasoner: Checks whether the given set of arguments is m-conflict-free, cf.
isMediatedAttack(BArgument, BArgument) - Method in class net.sf.tweety.arg.bipolar.syntax.DeductiveArgumentationFramework: Checks whether there exists a mediated attack from "arg1" to "arg2", i.e.
isMinimal() - Method in class net.sf.tweety.commons.util.rules.Derivation: Checks whether this derivation is minimal with respect to set inclusion.
isMinimalEvidenceSupportedAttack(Collection<BArgument>, BArgument) - Method in class net.sf.tweety.arg.bipolar.syntax.EvidentialArgumentationFramework: returns true if ext carries out a minimal evidence supported attack on argument i.e.
isMinimumFree() - Method in class net.sf.tweety.math.opt.problem.ConstraintSatisfactionProblem: Checks whether this problem uses no minimum function.
isMinimumFree() - Method in class net.sf.tweety.math.opt.problem.OptimizationProblem
isMNAdmissible(DungTheory, Collection<Argument>, int, int) - Method in class net.sf.tweety.arg.rankings.reasoner.IteratedGradedDefenseReasoner: Checks whether the given set of arguments is mn-admissible, cf.
isMNComplete(DungTheory, Collection<Argument>, int, int) - Method in class net.sf.tweety.arg.rankings.reasoner.IteratedGradedDefenseReasoner: Checks whether the given set of arguments is mn-complete, cf.
isMNGrounded(DungTheory, Collection<Argument>, int, int) - Method in class net.sf.tweety.arg.rankings.reasoner.IteratedGradedDefenseReasoner: Checks whether the given set of arguments is mn-grounded, cf.
isMNPreferred(DungTheory, Collection<Argument>, int, int) - Method in class net.sf.tweety.arg.rankings.reasoner.IteratedGradedDefenseReasoner: Checks whether the given set of arguments is mn-preferred, cf.
isMStable(DungTheory, Collection<Argument>, int) - Method in class net.sf.tweety.arg.rankings.reasoner.IteratedGradedDefenseReasoner: Checks whether the given set of arguments is m-stable, cf.
isNCycleFree(Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.NecessityArgumentationFramework: checks if a set of arguments S is N-Cycle-Free in this argumentation framework ie.
isNCycleFreeIn(BArgument, Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.NecessityArgumentationFramework: checks if argument is N-Cycle-Free in the set of arguments
isNilpotent() - Method in class net.sf.tweety.math.func.fuzzy.BoundedSum
isNilpotent() - Method in class net.sf.tweety.math.func.fuzzy.LukasiewiczNorm
isNilpotent() - Method in class net.sf.tweety.math.func.fuzzy.MaximumCoNorm
isNilpotent() - Method in class net.sf.tweety.math.func.fuzzy.MinimumNorm
isNilpotent() - Method in class net.sf.tweety.math.func.fuzzy.ProbabilisticSum
isNilpotent() - Method in class net.sf.tweety.math.func.fuzzy.ProductNorm
isNilpotent() - Method in class net.sf.tweety.math.func.fuzzy.TCoNorm: A T-conorm is nilpotent if there are x,y<1 with s(x,y)=1
isNilpotent() - Method in class net.sf.tweety.math.func.fuzzy.TNorm: A T-norm is nilpotent if there are x,y>0 with t(x,y)=0
isNonBipolar() - Method in enum net.sf.tweety.arg.adf.semantics.link.LinkType
isNoOperation() - Method in class net.sf.tweety.agents.dialogues.ExecutableDungTheory
isNoOperation() - Method in class net.sf.tweety.agents.dialogues.ExecutableExtension
isNoOperation() - Method in class net.sf.tweety.agents.dialogues.ExecutableFormulaSet
isNoOperation() - Method in interface net.sf.tweety.agents.Executable: Indicates whether this operation can be regarded as no operation at all.
isNormal(DefaultTheory) - Method in class net.sf.tweety.logics.rdl.syntax.DefaultRule: Tests, whether the default is normal normal ^= a:c/c
isNormalized() - Method in class net.sf.tweety.logics.cl.semantics.RankingFunction: Checkes whether this OCF is normalized, i.e.
isNormalized() - Method in class net.sf.tweety.math.equation.Equation
isNormalized() - Method in class net.sf.tweety.math.equation.Inequation
isNormalized() - Method in class net.sf.tweety.math.equation.Statement: Checks whether this constraint is of normalized form, i.e.
isNormalized() - Method in class net.sf.tweety.math.probability.ProbabilityFunction: Checks whether this probability function is normalized, i.e.
isNumeric(String) - Static method in class net.sf.tweety.commons.Parser: Checks whether the given string is a number.
isOrderedBefore(T, T) - Method in class net.sf.tweety.graphs.orders.Order: Checks whether object1 is ordered before object2.
IsoSafeEnumeratingDungTheoryGenerator - Class in net.sf.tweety.arg.dung.util: This generator generators all possible Dung argumentation theories (modulo graph isomorphism).
IsoSafeEnumeratingDungTheoryGenerator() - Constructor for class net.sf.tweety.arg.dung.util.IsoSafeEnumeratingDungTheoryGenerator: Creates a new enumerating Dung theory generator.
isOverlappingSignature(Signature) - Method in class net.sf.tweety.commons.DualSetSignature
isOverlappingSignature(Signature) - Method in class net.sf.tweety.commons.QuadrupleSetSignature
isOverlappingSignature(Signature) - Method in interface net.sf.tweety.commons.Signature: Checks whether this signature has common elements with the given signature, i.e.
isOverlappingSignature(Signature) - Method in class net.sf.tweety.commons.SingleSetSignature
isOverlappingSignature(Signature) - Method in class net.sf.tweety.commons.TripleSetSignature
isOverlappingSignature(Signature) - Method in class net.sf.tweety.logics.bpm.syntax.BpmnSignature
isOverruled(ArgumentationKnowledgeBase, Argument) - Method in class net.sf.tweety.arg.lp.reasoner.ArgumentationReasoner: An argument is called x/y-overruled, if it is attacked by an x/y-justified argument.
isOverruled(ArgumentationKnowledgeBase, ASPLiteral) - Method in class net.sf.tweety.arg.lp.reasoner.LiteralReasoner: A literal is called x/y-overruled, iff it is not x/y-justified.
isPositive() - Method in class net.sf.tweety.math.term.Variable: Checks whether this variables should be positive.
isProcess() - Method in class net.sf.tweety.logics.rdl.semantics.DefaultSequence: process <=> all defaults are unique and applicable in sequence
isRedundant() - Method in enum net.sf.tweety.arg.adf.semantics.link.LinkType
isRelated(T, T) - Method in interface net.sf.tweety.preferences.BinaryRelation: returns whether the elements a and b are related
isRelated(T, T) - Method in class net.sf.tweety.preferences.PreferenceOrder: returns whether the elements a and b are related
isRelativelyCoherent() - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: Determines if the theory is relatively coherent, i.e., if the grounded extension coincides with the intersection of all preferred extensions
isRepresentable(FolFormula) - Method in class net.sf.tweety.logics.fol.syntax.FolSignature: Checks whether the given formula can be represented by this signature.
isSafe() - Method in class net.sf.tweety.lp.asp.syntax.ASPRule: This methods tests a rule for safety.
isSafe() - Method in class net.sf.tweety.lp.asp.syntax.Program: Returns true if the program is safe, i.e.
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.arg.adf.sat.IncrementalSatSolver
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.arg.adf.sat.SimpleIncrementalSatSolver
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.sat.LingelingSolver
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.sat.MaxSatSolver
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.sat.Sat4jSolver
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.sat.SatSolver: Checks whether the given set of formulas is satisfiable.
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.pl.sat.SimpleDpllSolver
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.qbf.reasoner.CadetSolver
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.qbf.reasoner.CaqeSolver
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.qbf.reasoner.GhostQSolver
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.qbf.reasoner.QbfSolver: Checks whether the given set of formulas is satisfiable.
isSatisfiable(Collection<PlFormula>) - Method in class net.sf.tweety.logics.qbf.reasoner.QuteSolver
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaAbstraction
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaAdditionOfAttackBranch
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaAdditionOfDefenseBranch
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaAttackVsFullDefense
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaCardinalityPrecedence
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaCounterTransitivity
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaDefensePrecedence
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaDistDefensePrecedence
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaIncreaseOfAttackBranch
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaIncreaseOfDefenseBranch
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaIndependence
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RankingPostulate
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaNonAttackedEquivalence
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaQualityPrecedence
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaSelfContradiction
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaStrictAdditionOfDefenseBranch
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaStrictCounterTransitivity
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaTotal
isSatisfied(Collection<Argument>, AbstractRankingReasoner<ArgumentRanking>) - Method in class net.sf.tweety.arg.rankings.postulates.RaVoidPrecedence
isSatisfied(Collection<Argument>, PostulateEvaluatable<Argument>) - Method in class net.sf.tweety.arg.rankings.postulates.RankingPostulate
isSatisfied(Collection<PlFormula>, PostulateEvaluatable<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImPostulate
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImAdjunctionInvariance
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImAttenuation
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImConsistency
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImContradiction
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImDominance
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImEqualConflict
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImExchange
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImFreeFormulaDilution
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImFreeFormulaIndependence
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImIrrelevanceOfSyntax
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImMINormalization
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImMISeparability
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImMonotony
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImNormalization
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImPenalty
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImPostulate
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImSafeFormulaIndependence
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImSuperAdditivity
isSatisfied(Collection<PlFormula>, BeliefSetInconsistencyMeasure<PlFormula>) - Method in class net.sf.tweety.logics.pl.postulates.ImWeakDominance
isSatisfied(Collection<S>, PostulateEvaluatable<S>) - Method in interface net.sf.tweety.commons.postulates.Postulate: Checks whether this postulate is satisfied by the given approach ev wrt.
isSatisfied(TransitionSystem, Set<ActionQuery>) - Method in interface net.sf.tweety.action.query.analysis.ActionQuerySatisfactionTester: Checks whether the given transition system satisfies the given action queries.
isSatisfied(TransitionSystem, Set<ActionQuery>) - Method in class net.sf.tweety.action.query.analysis.SActionQuerySatisfactionTester
isSatisfied(TransitionSystem, BeliefBase) - Method in interface net.sf.tweety.action.query.analysis.ActionQuerySatisfactionTester: Checks whether the given transition system satisfies the given action queries.
isSatisfied(TransitionSystem, BeliefBase) - Method in class net.sf.tweety.action.query.analysis.SActionQuerySatisfactionTester
isSingleStep() - Method in class net.sf.tweety.agents.dialogues.structured.SasAgent: Checks whether this agent is a single-step argumentation agent, i.e.
IssReasoner - Class in net.sf.tweety.arg.social.reasoner: This reasoner provides is an implementation of the "Iterative Successive Subsitution Algorithm" from [Marco Correia and Jorge Cruz and João Leite.
IssReasoner(SimpleProductSemantics, double) - Constructor for class net.sf.tweety.arg.social.reasoner.IssReasoner: Creates a new reasoner.
isStable(Extension) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: Checks whether the given extension is stable wrt.
isStrict() - Method in class net.sf.tweety.arg.aspic.syntax.AspicArgument: An argument is strict iff it does not contain defeasible subrules
isStrict() - Method in class net.sf.tweety.logics.mln.syntax.MlnFormula: Returns "true" iff this formula is strict.
isStrictlyLessAcceptableThan(Argument, Argument) - Method in class net.sf.tweety.arg.rankings.semantics.ArgumentRanking: Returns "true" iff a is strictly less acceptable than b, i.e.
isStrictlyLessOrEquallyAcceptableThan(Argument, Argument) - Method in class net.sf.tweety.arg.rankings.semantics.ArgumentRanking: Returns "true" iff a is strictly less acceptable than b or a is equally acceptable as b or a and b are not comparable, i.e.
isStrictlyLessOrEquallyAcceptableThan(Argument, Argument) - Method in class net.sf.tweety.arg.rankings.semantics.LatticeArgumentRanking
isStrictlyLessOrEquallyAcceptableThan(Argument, Argument) - Method in class net.sf.tweety.arg.rankings.semantics.NumericalArgumentRanking
isStrictlyMoreAcceptableThan(Argument, Argument) - Method in class net.sf.tweety.arg.rankings.semantics.ArgumentRanking: Returns "true" iff a is strictly more acceptable than b, i.e.
isStrictlyMoreOrEquallyAcceptableThan(Argument, Argument) - Method in class net.sf.tweety.arg.rankings.semantics.ArgumentRanking: Returns "true" iff a is strictly more acceptable than b or a is equally acceptable as b, i.e.
isStrictSubsetOf(Interpretation) - Method in interface net.sf.tweety.arg.adf.semantics.interpretation.Interpretation
isStrictSupersetOf(Interpretation) - Method in class net.sf.tweety.arg.adf.semantics.interpretation.EmptyInterpretation
isStrictSupersetOf(Interpretation) - Method in interface net.sf.tweety.arg.adf.semantics.interpretation.Interpretation
isStronglyCoherent(Collection<BArgument>) - Method in class net.sf.tweety.arg.bipolar.syntax.NecessityArgumentationFramework: checks whether the given set of arguments is strongly coherent in this argumentation framework a set of arguments is strongly coherent iff it is coherent an conflict-free
isStrongSubargumentOf(DelpArgument) - Method in class net.sf.tweety.arg.delp.syntax.DelpArgument: Checks whether this argument is a strong subargument of the given argument, i.e., if the support of this argument is a strict subset of the support of the given argument
isSubargumentOf(DelpArgument) - Method in class net.sf.tweety.arg.delp.syntax.DelpArgument: Checks whether this argument is a subargument of the given argument
isSubArgumentOf(AspicArgument<T>) - Method in class net.sf.tweety.arg.aspic.syntax.AspicArgument: Checks wheter this is a direct or indirect subargument of arg
isSubsetOf(Interpretation) - Method in class net.sf.tweety.arg.adf.semantics.interpretation.EmptyInterpretation
isSubsetOf(Interpretation) - Method in interface net.sf.tweety.arg.adf.semantics.interpretation.Interpretation
isSubSignature(Signature) - Method in class net.sf.tweety.commons.DualSetSignature
isSubSignature(Signature) - Method in class net.sf.tweety.commons.QuadrupleSetSignature
isSubSignature(Signature) - Method in interface net.sf.tweety.commons.Signature: Checks whether this signature is a sub-signature of the given signature, i.e.
isSubSignature(Signature) - Method in class net.sf.tweety.commons.SingleSetSignature
isSubSignature(Signature) - Method in class net.sf.tweety.commons.TripleSetSignature
isSubSignature(Signature) - Method in class net.sf.tweety.logics.bpm.syntax.BpmnSignature
isSubsumedBy(ComplexConcept, ComplexConcept) - Method in class net.sf.tweety.logics.dl.semantics.DlInterpretation: Checks whether a concept is subsumed by another concept (c1 => c2) wrt to this interpretation
isSuccessful() - Method in class net.sf.tweety.logics.rdl.semantics.DefaultSequence: successfull <=> there is no x: x in In and x in Out
isSuperMediatedAttack(BArgument, BArgument) - Method in class net.sf.tweety.arg.bipolar.syntax.DeductiveArgumentationFramework: Checks whether there exists a super-mediated attack from "arg1" to "arg2", i.e.
isSupersetOf(Interpretation) - Method in interface net.sf.tweety.arg.adf.semantics.interpretation.Interpretation
isSupport(Argument, Argument) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: Checks whether "arg1" supports "arg2", i.e.
isSupportedAttack(BArgument, BArgument) - Method in class net.sf.tweety.arg.bipolar.syntax.DeductiveArgumentationFramework: Checks whether there exists a supported attack from "arg1" to "arg2", i.e.
isSupporting() - Method in enum net.sf.tweety.arg.adf.semantics.link.LinkType
isSyntacticallyEquivalent(HerbrandInterpretation, Collection<? extends Collection<? extends Constant>>) - Method in class net.sf.tweety.logics.fol.semantics.HerbrandInterpretation: Checks whether this interpretation is syntactically equivalent to the given interpretation and the given equivalence classes, i.e.
isSyntacticallyEquivalent(MlHerbrandInterpretation, Collection<? extends Collection<? extends Constant>>) - Method in class net.sf.tweety.logics.ml.semantics.MlHerbrandInterpretation: Checks whether this interpretation is syntactically equivalent to the given interpretation and the given equivalence classes, i.e.
isTargetLinear() - Method in class net.sf.tweety.math.opt.problem.OptimizationProblem: Checks whether the target function is linear.
isTotal() - Method in interface net.sf.tweety.preferences.BinaryRelation: checks whether the set is total or not
isTotal() - Method in class net.sf.tweety.preferences.PreferenceOrder: checks whether the set is total or not
isTransitive() - Method in interface net.sf.tweety.preferences.BinaryRelation: checks whether the given set is transitive or not
isTransitive() - Method in class net.sf.tweety.preferences.PreferenceOrder: checks whether the given set is transitive or not
isTyped() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.TypedStructure
isTyped() - Method in class net.sf.tweety.logics.commons.syntax.TypedStructureAdapter
isValid() - Method in interface net.sf.tweety.preferences.BinaryRelation: checks whether the preference order is valid (transitive, total and unique)
isValid() - Method in class net.sf.tweety.preferences.PreferenceOrder: checks whether the given set represents a valid preference order
isValid(String) - Method in class net.sf.tweety.plugin.parameter.CommandParameter: Checks, if the given String is a valid argument for this command parameter
isValid(String) - Method in class net.sf.tweety.plugin.parameter.CustomStringListCommandParameter: valid iff string matches criteria
isValid(String) - Method in class net.sf.tweety.plugin.parameter.FileListCommandParameter: checks whether a cli input parameter argument is valid for the called command parameter
isValid(String) - Method in class net.sf.tweety.plugin.parameter.IntegerCommandParameter: checks whether a cli input parameter argument is valid for the called command parameter
isValid(String) - Method in class net.sf.tweety.plugin.parameter.SelectionCommandParameter: checks whether a cli input parameter argument is valid for the called command parameter
isValid(String) - Method in class net.sf.tweety.plugin.parameter.StringListCommandParameter: checks each input string for validity
isValid(ArrayList<ElementOfCombinatoricsProb>) - Method in class net.sf.tweety.math.examples.KnapSack
isValid(ArrayList<ElementOfCombinatoricsProb>) - Method in class net.sf.tweety.math.examples.TravelingSalesman
isValid(ArrayList<ElementOfCombinatoricsProb>) - Method in class net.sf.tweety.math.opt.problem.CombinatoricsProblem
isValid(Collection<Extension>) - Method in class net.sf.tweety.arg.dung.divisions.Division: Checks whether this division is valid wrt.
isValid(Map<Variable, Constant>) - Method in interface net.sf.tweety.action.grounding.GroundingRequirement: This method checks, if an assignment of constants to variables satisfies a given grounding condition.
isValid(Map<Variable, Constant>) - Method in class net.sf.tweety.action.grounding.VarConstNeqRequirement
isValid(Map<Variable, Constant>) - Method in class net.sf.tweety.action.grounding.VarsNeqRequirement
isValid(Extension) - Method in class net.sf.tweety.arg.dung.divisions.Division: Checks whether this division is valid wrt.
isValid(StructuredArgumentationFramework) - Method in class net.sf.tweety.arg.saf.syntax.ArgumentStructure: Checks whether this argument structure is valid wrt.
isValidFormula(Formula) - Method in class net.sf.tweety.action.signature.ActionSignature: Checks, if a given formula is valid in the sense of an action description, containing only predicates that are either fluentnames or actionnames and containing neither quantifiers nor functions.
isValidGroundingApplication(Map<Variable, Constant>, Set<GroundingRequirement>) - Static method in class net.sf.tweety.action.grounding.GroundingTools: Checks a grounding application for compliance with the grounding requirements.
isWeightedGraph() - Method in class net.sf.tweety.arg.bipolar.syntax.AbstractBipolarFramework
isWeightedGraph() - Method in class net.sf.tweety.arg.dung.syntax.DungTheory
isWeightedGraph() - Method in class net.sf.tweety.arg.prob.syntax.ProbabilisticArgumentationFramework
isWeightedGraph() - Method in class net.sf.tweety.graphs.DefaultGraph
isWeightedGraph() - Method in interface net.sf.tweety.graphs.Graph: Checks whether this graph only contains weighted edges.
isWeightedGraph() - Method in class net.sf.tweety.logics.bpm.syntax.BpmnModel
isWellBound() - Method in class net.sf.tweety.arg.delp.syntax.DelpRule
isWellBound() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormula: Checks whether this formula is well-bound, i.e.
isWellBound() - Method in class net.sf.tweety.logics.commons.syntax.QuantifiedFormulaSupport
isWellBound() - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
isWellBound() - Method in class net.sf.tweety.logics.fol.syntax.Equivalence
isWellBound() - Method in class net.sf.tweety.logics.fol.syntax.ExistsQuantifiedFormula
isWellBound() - Method in class net.sf.tweety.logics.fol.syntax.FolAtom
isWellBound() - Method in class net.sf.tweety.logics.fol.syntax.ForallQuantifiedFormula
isWellBound() - Method in class net.sf.tweety.logics.fol.syntax.Implication
isWellBound() - Method in class net.sf.tweety.logics.fol.syntax.Negation
isWellBound() - Method in class net.sf.tweety.logics.fol.syntax.SpecialFormula
isWellBound() - Method in class net.sf.tweety.logics.ml.syntax.MlFormula
isWellBound() - Method in class net.sf.tweety.logics.mln.syntax.MlnFormula
isWellBound() - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional
isWellBound() - Method in class net.sf.tweety.logics.rdl.syntax.DefaultRule
isWellBound() - Method in class net.sf.tweety.lp.nlp.syntax.NLPNot
isWellBound(Set<Variable>) - Method in class net.sf.tweety.arg.delp.syntax.DelpRule
isWellBound(Set<Variable>) - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormula: Checks whether this formula is well-bound, i.e.
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.commons.syntax.QuantifiedFormulaSupport
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.Equivalence
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.ExistsQuantifiedFormula
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.FolAtom
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.ForallQuantifiedFormula
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.Implication
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.Negation
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.fol.syntax.SpecialFormula
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.ml.syntax.MlFormula
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.mln.syntax.MlnFormula
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional
isWellBound(Set<Variable>) - Method in class net.sf.tweety.logics.rdl.syntax.DefaultRule
isWellBound(Set<Variable>) - Method in class net.sf.tweety.lp.nlp.syntax.NLPNot
isWellFormed() - Method in class net.sf.tweety.arg.aba.syntax.AbaElement
isWellFormed() - Method in class net.sf.tweety.arg.aspic.syntax.InferenceRule
isWellFormed() - Method in class net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport
isWellFormed() - Method in class net.sf.tweety.logics.commons.syntax.ComplexLogicalFormulaAdapter
isWellFormed() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.ComplexLogicalFormula: Checks if this formula is well formed in the logical langauge.
isWellFormed() - Method in class net.sf.tweety.logics.commons.syntax.RelationalFormula: Tests whether this formula is well-formed, i.e.
isWellFormed() - Method in class net.sf.tweety.lp.asp.syntax.ASPElement
isWellFormed() - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
isWellFormed() - Method in class net.sf.tweety.lp.asp.syntax.DefaultNegation
isWellFounded() - Method in class net.sf.tweety.arg.dung.syntax.DungTheory: returns true iff the theory is well-founded, i.e., there is no infinite sequence A1,A2,...
isWithinTolerance(Probability) - Method in class net.sf.tweety.math.probability.Probability: Checks whether the given probability is "nearly" the same as this probability (given the actual precision).
itemStateChanged(ItemEvent) - Method in class net.sf.tweety.beliefdynamics.gui.RevisionComparePresenter
itemStateChanged(ItemEvent) - Method in class net.sf.tweety.lp.asp.beliefdynamics.gui.SimpleRevisionComparePresenter
IteratedGradedDefenseReasoner - Class in net.sf.tweety.arg.rankings.reasoner: This class implements the argument ranking approach of [Grossi, Modgil.
IteratedGradedDefenseReasoner() - Constructor for class net.sf.tweety.arg.rankings.reasoner.IteratedGradedDefenseReasoner
IteratedGradedDefenseReasonerExample - Class in net.sf.tweety.arg.rankings.examples: Example code for using the iterated graded semantics by Grossi/Modgil
IteratedGradedDefenseReasonerExample() - Constructor for class net.sf.tweety.arg.rankings.examples.IteratedGradedDefenseReasonerExample
iterateExamples(int, int) - Static method in class net.sf.tweety.logics.mln.examples.MlnExample
IteratingMlnReasoner - Class in net.sf.tweety.logics.mln.reasoner: This MLN reasoner takes another MLN reasoner and performs several iterations with this one and takes the average result as result.
IteratingMlnReasoner(AbstractMlnReasoner, long) - Constructor for class net.sf.tweety.logics.mln.reasoner.IteratingMlnReasoner: Creates a new IteratingMlnReasoner for the given MLN reaasoner.
iterator() - Method in class net.sf.tweety.action.signature.FolAction
iterator() - Method in class net.sf.tweety.agents.MultiAgentSystem
iterator() - Method in class net.sf.tweety.arg.aba.semantics.AbaExtension
iterator() - Method in class net.sf.tweety.arg.adf.util.MinusSetView
iterator() - Method in class net.sf.tweety.arg.adf.util.UnionSetView
iterator() - Method in class net.sf.tweety.arg.bipolar.syntax.ArgumentSet
iterator() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoAssociativeFormula
iterator() - Method in class net.sf.tweety.arg.dung.semantics.Extension
iterator() - Method in class net.sf.tweety.arg.saf.syntax.ArgumentStructure
iterator() - Method in class net.sf.tweety.commons.BeliefSet
iterator() - Method in class net.sf.tweety.commons.InterpretationSet
iterator() - Method in class net.sf.tweety.commons.SingleSetSignature
iterator() - Method in class net.sf.tweety.graphs.DefaultGraph
iterator() - Method in interface net.sf.tweety.graphs.Graph
iterator() - Method in class net.sf.tweety.logics.bpm.syntax.BpmnModel
iterator() - Method in class net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport
iterator() - Method in class net.sf.tweety.logics.dl.syntax.AssociativeDlFormula
iterator() - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
iterator() - Method in class net.sf.tweety.logics.pl.syntax.AssociativePlFormula
iterator() - Method in class net.sf.tweety.logics.rdl.semantics.Extension
iterator() - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
iterator() - Method in class net.sf.tweety.math.Interval
iterator() - Method in class net.sf.tweety.preferences.PreferenceOrder
iterator(Set<Triple<T, T, Relation>>) - Method in class net.sf.tweety.preferences.PreferenceOrder: returns an iterator over a set of triples
iterator(AbstractDialecticalFramework) - Method in class net.sf.tweety.arg.adf.reasoner.sat.Pipeline

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
All Classes All Packages