Uses of Interface
org.tweetyproject.commons.Formula
Package
Description
-
Uses of Formula in org.tweetyproject.action.description.parser
Modifier and TypeMethodDescriptionCLawParser.parseFormula
(Reader reader) CLawParser.parseFormula
(String s) CParser.parseFormula
(Reader reader) Parses a formula from the given reader.CParser.parseFormula
(String formula) Parses the given formula string and returns the corresponding Formula object. -
Uses of Formula in org.tweetyproject.action.description.syntax
Modifier and TypeInterfaceDescriptioninterface
A basic interface representing a causal law.Modifier and TypeClassDescriptionclass
The action description language C consists of two distinct expressions: static laws and dynamic laws.class
A dynamic law in C has the form "caused F if G after U" where F is a propositional formula over the set of fluent names (called headFormula) G is a propositional formula over the set of fluent names (called ifFormula) U is a propositional formula over the set of fluent names and the set of action names (called afterFormula)class
This class represents a static rule in C, which has the following form: "caused H if G" where H is a propositional formula over the set of fluents and G is a propositional formula over the set of fluents and the set of actions -
Uses of Formula in org.tweetyproject.action.query.syntax
Modifier and TypeInterfaceDescriptioninterface
This is a basic interface for action queries.Modifier and TypeClassDescriptionclass
This class represents an always query in the action query language S.class
This class represents a holds query in the action query language S.class
This class represents a necessarily query in the action query language S.class
Action queries are represented as propositional formulas with three possible types of propositions: "holds", "always" and "necessarily" propositions.class
This class represents a single action query in the action query language S, which is based on the query language "P" discussed in the paper: Action Languages. -
Uses of Formula in org.tweetyproject.action.signature
Modifier and TypeMethodDescriptionboolean
ActionSignature.isValidFormula
(Formula f) Checks if a given formula is valid in the sense of an action description. -
Uses of Formula in org.tweetyproject.arg.aba.parser
Modifier and TypeClassDescriptionclass
Parses an Assumption-Based Argumentation (ABA) System from an input text.ModifierConstructorDescriptionAbaParser
(Parser<? extends BeliefBase, ? extends Formula> formulaparser) Creates a new ABA parser. -
Uses of Formula in org.tweetyproject.arg.aba.reasoner
Modifier and TypeClassDescriptionclass
CompleteReasoner<T extends Formula>
This reasoner for ABA theories performs inference on the complete extensions.class
FlatAbaReasoner<T extends Formula>
This class models a reasoner over ABA formulae.class
GeneralAbaReasoner<T extends Formula>
This is an abstract generalization over non-flat ABA reasoners.class
IdealReasoner<T extends Formula>
This reasoner for ABA theories performs inference on the ideal extension.class
PreferredReasoner<T extends Formula>
This reasoner for ABA theories performs inference on the preferred extensions.class
StableReasoner<T extends Formula>
This reasoner for ABA theories performs inference on the stable extensions.class
WellFoundedReasoner<T extends Formula>
This reasoner for ABA theories performs inference on the ideal extension. -
Uses of Formula in org.tweetyproject.arg.aba.semantics
Modifier and TypeClassDescriptionclass
This class models an ABA attack.class
AbaExtension<T extends Formula>
This class models an ABA Extension, meaning a set of assumptions.Modifier and TypeClassDescriptionclass
This class models an ABA attack.Modifier and TypeMethodDescriptionstatic <T extends Formula>
Collection<AbaAttack<T>> AbaAttack.allAttacks
(Collection<Assumption<T>> from, Collection<Assumption<T>> to, AbaTheory<T> abat) Returns all attacks from the given attacking set to the given attacked set.static <T extends Formula>
Collection<AbaAttack<T>> AbaAttack.allAttacks
(AbaTheory<T> abat) Returns all attacks between arguments in the given AbaTheory. -
Uses of Formula in org.tweetyproject.arg.aba.syntax
Modifier and TypeClassDescriptionclass
AbaElement<T extends Formula>
Abstract class that models common properties of aba syntax elements.class
A common interface for assumptions and inference rules.class
An implementation of Assumption Based Argumentation.class
Assumption<T extends Formula>
This class models an assumption of an ABA theory.class
An argument derived from an ABA theory.class
InferenceRule<T extends Formula>
This class models an inference rule from an ABA theory.class
This represents a negation relation of formModifier and TypeClassDescriptionclass
AbaElement<T extends Formula>
Abstract class that models common properties of aba syntax elements.class
A common interface for assumptions and inference rules.class
Assumption<T extends Formula>
This class models an assumption of an ABA theory.class
An argument derived from an ABA theory.class
InferenceRule<T extends Formula>
This class models an inference rule from an ABA theory.class
This represents a negation relation of form -
Uses of Formula in org.tweetyproject.arg.aspic.parser
ModifierConstructorDescriptionAspicParser
(Parser<? extends BeliefBase, ? extends Formula> formulaparser, RuleFormulaGenerator<T> rfg) Constructs a new instance -
Uses of Formula in org.tweetyproject.arg.aspic.semantics
Modifier and TypeClassDescriptionclass
AspicAttack<T extends Invertable>
Checks whether an argument defeats another argument -
Uses of Formula in org.tweetyproject.arg.aspic.syntax
Modifier and TypeClassDescriptionclass
AspicArgument<T extends Invertable>
An argument according to the ASPIC+ specificationclass
DefeasibleInferenceRule<T extends Invertable>
Defeasible implementation ofInferenceRule<T>
class
InferenceRule<T extends Invertable>
This stands for an inference rule or for a premise if premises has length 0.class
StrictInferenceRule<T extends Invertable>
Indefeasible implementation ofInferenceRule<T>
-
Uses of Formula in org.tweetyproject.arg.bipolar.syntax
Modifier and TypeInterfaceDescriptioninterface
This interface captures common methods of different interpretations of the attack relation in bipolar abstract argumentation theories.interface
This interface captures common methods of arguments and argument sets of bipolar abstract argumentation theories.interface
This interface captures common methods of different interpretations of the support relation in bipolar abstract argumentation theories.Modifier and TypeClassDescriptionclass
This class models a set of arguments used in the context of bipolar abstract argumentation theory.class
This class models an argument used by bipolar abstract argumentation theories.class
This class models a binary attack relation between two arguments.class
This class models a support between two arguments.class
Evidential attack used for PEAF and EAFclass
This class models an attack between a set of arguments and an argument.class
This class models a support between a set of arguments and an argument.class
Represents a weighted support relationship between two argument sets. -
Uses of Formula in org.tweetyproject.arg.deductive.syntax
Modifier and TypeClassDescriptionclass
Represents a simple propositional logic argument in deductive argumentation.class
Represents a simple propositional logic rule. -
Uses of Formula in org.tweetyproject.arg.delp.parser
Modifier and TypeMethodDescriptionDelpParser.parseFormula
(Reader reader) A formula here is a Literal, that is an Atom or a negated Atom. -
Uses of Formula in org.tweetyproject.arg.delp.syntax
Modifier and TypeClassDescriptionclass
This class models a defeasible rule in defeasible logic programming.class
This class models a DeLP argument which comprises of a set of defeasible rules (the support) and a literal (the conclusion).final class
This class implements a fact in defeasible logic programming which encapsulates a literal.class
This method is the superclass for both a strict rule and a defeasible rule in defeasible logic programming and captures their common attributes and methods.class
This class models a strict rule in defeasible logic programming. -
Uses of Formula in org.tweetyproject.arg.dung.causal.syntax
Modifier and TypeClassDescriptionclass
This class is responsible for the representation of anArgument
that was induced by aCausalKnowledgeBase
Reference: "Argumentation-based Causal and Counterfactual Reasoning" by Lars Bengel, Lydia Blümel, Tjitze Rienstra and Matthias Thimm, published at 1st International Workshop on Argumentation for eXplainable AI (ArgXAI, co-located with COMMA ’22), September 12, 2022 -
Uses of Formula in org.tweetyproject.arg.dung.ldo.syntax
Modifier and TypeClassDescriptionclass
Provides common functionalities for the graph-based modalities in LDO.class
Provides common functionalities for all modalities in LDO.class
This class represents an argument in ldo.class
This class captures the common functionalities of formulas with an associative operation like conjunction, disjunction, etc.class
Represents the box modality in the logic of dialectical outcomes (LDO).class
This class represents a conjunction in ldo logic.class
Represents the diamond modality in the logic of dialectical outcomes (LDO).class
This class represents a disjunction in ldo logic.class
This abstract class specifies the general methods of all Ldo-formulas (LDO - Logic of dialectical outcomes, cf.class
Represents the graph box modality in the logic of dialectical outcomes (LDO).class
Represents the graph diamond modality in the logic of dialectical outcomes (LDO).class
This class models classical negation of ldo logic.class
Creates a relational formula, i.e. -
Uses of Formula in org.tweetyproject.arg.dung.parser
-
Uses of Formula in org.tweetyproject.arg.dung.syntax
Modifier and TypeInterfaceDescriptioninterface
This interface captures common methods of arguments and attacks of abstract argumentation theories.Modifier and TypeClassDescriptionclass
This class models an argument used by Dung's abstract argumentation theory and is just described by its name.class
This class models an attack between two arguments.class
an argument with a claim -
Uses of Formula in org.tweetyproject.arg.extended.syntax
Modifier and TypeClassDescriptionclass
Represents an Extended Attack, i.e., an attack from some argument to another (extended) attack or argument -
Uses of Formula in org.tweetyproject.arg.lp.syntax
Modifier and TypeClassDescriptionclass
Instances of this class represent arguments in the sense of Definition 2 in [1]. -
Uses of Formula in org.tweetyproject.arg.saf.syntax
Modifier and TypeClassDescriptionclass
This class models an argument structure, i.e.class
This class models a basic argument in structured argumentation frameworks, i.e. -
Uses of Formula in org.tweetyproject.arg.setaf.syntax
Modifier and TypeClassDescriptionclass
This class models an attack between two arguments. -
Uses of Formula in org.tweetyproject.beliefdynamics
Modifier and TypeInterfaceDescriptioninterface
BaseContractionOperator<T extends Formula>
This is the interface for a classic belief base contraction operator, ie.interface
BaseExpansionOperator<T extends Formula>
This is the interface for a classic belief base expansion operator, ie.interface
BaseRevisionOperator<T extends Formula>
This is the interface for a classic belief base revision operator, ie.class
CredibilityRevision<T extends Formula>
Abstract base class for a revision process on belief bases of type TBeliefBase, it provides a method to revise one belief base with another and a method to revise a ordered list of belief bases.class
CredibilityRevisionIterative<T extends Formula>
Implements the list based method of the Revision interface by iterative calling the revision method which revise two belief bases.class
CredibilityRevisionNonIterative<T extends Formula>
Implements the revision method with two belief bases by delegating the processing to the revision method bases on an ordered list of belief bases.class
DefaultBaseExpansionOperator<T extends Formula>
This class implements the default base expansion operator, ie.class
DefaultMultipleBaseExpansionOperator<T extends Formula>
This class implements the default multiple base expansion operator, ie.class
MultipleBaseContractionOperator<T extends Formula>
This is the interface for a classic multiple belief base contraction operator, ie.class
MultipleBaseExpansionOperator<T extends Formula>
This is the interface for a classic multiple belief base expansion operator, ie.class
MultipleBaseRevisionOperator<T extends Formula>
This is the interface for a classic multiple belief base revision operator, ie. -
Uses of Formula in org.tweetyproject.beliefdynamics.gui
Modifier and TypeMethodDescriptionCollection
<? extends Formula> Loads a collection of formulas from the given file.Modifier and TypeMethodDescriptionvoid
RevisionCompareModel.addBeliefbase
(Collection<? extends Formula> beliefBase) Adds a belief base to the end of the ordered list of belief bases. -
Uses of Formula in org.tweetyproject.beliefdynamics.kernels
Modifier and TypeInterfaceDescriptioninterface
IncisionFunction<T extends Formula>
This interface models an incision function for kernel contraction, ie a function that incises each of the kernel sets of some set.class
KernelContractionOperator<T extends Formula>
This class implements kernel contraction for belief bases [Hansson:2001].class
RandomIncisionFunction<T extends Formula>
This class implements an incision function that just randomly selects a minimal incision. -
Uses of Formula in org.tweetyproject.beliefdynamics.mas
Modifier and TypeClassDescriptionclass
CrMasBeliefSet<T extends Formula,
S extends Signature> This class represents belief sets for credibility-based agents multi-agent systems.class
CrMasRevisionWrapper<T extends Formula>
This class is a wrapper for a revision for formulas of type T that is used to revise information objects.class
InformationObject<T extends Formula>
This class represents a formula annotated with the source of the formula.Modifier and TypeClassDescriptionclass
InformationObject<T extends Formula>
This class represents a formula annotated with the source of the formula. -
Uses of Formula in org.tweetyproject.beliefdynamics.selectiverevision
Modifier and TypeClassDescriptionclass
MultipleSelectiveRevisionOperator<T extends Formula>
This class implements a multiple selective revision operator following [Kruempelmann:2011,Ferme:1999].interface
MultipleTransformationFunction<T extends Formula>
This interface represents a multiple transformation function for selective revision [Kruempelmann:2011,Ferme:1999].class
SelectiveRevisionOperator<T extends Formula>
This class implements a selective revision operator following [Ferme:1999].interface
TransformationFunction<T extends Formula>
This interface represents a transformation function for selective revision [Ferme:1999]. -
Uses of Formula in org.tweetyproject.commons
Modifier and TypeClassDescriptionclass
AbstractInterpretation<B extends BeliefBase,
S extends Formula> An abstract interpretation for some logical language.class
This class models a belief set, i.e.interface
BeliefSetIterator<T extends Formula,
U extends BeliefSet<T, ?>> Classes implementing this interface are able to enumerate belief sets.class
BeliefSetSampler<T extends Formula,
U extends BeliefSet<T, ?>> This abstract class models a random sampler for belief sets.class
FormulaSampler<T extends Formula>
This abstract class models a sampler for formulas.interface
Interpretation<B extends BeliefBase,
S extends Formula> An interpretation for some logical language.interface
InterpretationIterator<S extends Formula,
B extends BeliefBase, T extends Interpretation<B, S>> An iterator over interpretations.class
InterpretationSet<T extends Formula,
B extends BeliefBase, S extends Formula> This class models an interpretation that is a set of some formula and as such implements the java.util.Collection interface.class
InterpretationSet<T extends Formula,
B extends BeliefBase, S extends Formula> This class models an interpretation that is a set of some formula and as such implements the java.util.Collection interface.interface
KernelProvider<T extends Formula>
Classes implementing this interface are able to provide kernels (=minimal proofs).interface
ModelProvider<S extends Formula,
B extends BeliefBase, T extends Interpretation<B, S>> Instances of this interface model reasoners that determine the (selected) models for a given set of formulas.class
Parser<T extends BeliefBase,
S extends Formula> This class models an abstract parser for belief bases and formulas.interface
QualitativeReasoner<B extends BeliefBase,
F extends Formula> This interface represents a general contract for qualitative reasoners, which are objects that can query a belief base with a specific formula and return a boolean result (`TRUE` or `FALSE`) based on the reasoning process.interface
QuantitativeReasoner<B extends BeliefBase,
F extends Formula> The general interface for objects that are able to query a belief base with some formula and return a degree (double value) of its acceptability.interface
Reasoner<O,
B extends BeliefBase, F extends Formula> The general interface for objects that are able to query a belief base with some formula.Modifier and TypeMethodDescriptionboolean
Adds the specified elements to the end of this collection (optional operation).boolean
Adds the specified elements to the end of this collection (optional operation).Modifier and TypeMethodDescriptionInterpretationIterator.reset
(Collection<? extends Formula> formulas) Initializes a new reseted iterator for the given signature derived from the given set of formulas. -
Uses of Formula in org.tweetyproject.commons.analysis
Modifier and TypeClassDescriptionclass
DrasticDistance<T extends Interpretation<B,
S>, B extends BeliefBase, S extends Formula> This class models the drastic distance measure between interpretations, see [Grant, Hunter.interface
InterpretationDistance<T extends Interpretation<B,
S>, B extends BeliefBase, S extends Formula> Classes implementing this interface represent distance functions between two interpretations. -
Uses of Formula in org.tweetyproject.commons.postulates
Modifier and TypeInterfaceDescriptioninterface
Models a general (rationality) postulate, i.e.interface
PostulateEvaluatable<S extends Formula>
Classes implementing this interface can be evaluated wrt.class
PostulateEvaluationReport<S extends Formula>
Summarises the results of a postulate evaluation.class
PostulateEvaluator<T extends Formula,
U extends BeliefSet<T, ?>> Evaluates some approach (reasoner, measure, etc.) wrt. -
Uses of Formula in org.tweetyproject.commons.streams
Modifier and TypeClassDescriptionclass
DefaultFormulaStream<S extends Formula>
This class models a default stream on the formulas of a given collection.interface
FormulaStream<S extends Formula>
This interface models a stream on formulas. -
Uses of Formula in org.tweetyproject.commons.util.rules
Modifier and TypeInterfaceDescriptioninterface
This interface models a general rule, i.e.interface
This interface models a general rule, i.e.Modifier and TypeInterfaceDescriptioninterface
This interface models a general rule, i.e.Modifier and TypeMethodDescriptionDerivation.getConclusion()
Returns the conclusion of this derivation.Modifier and TypeMethodDescriptionRuleSet.getConclusions()
Returns all conclusions of all rules of this rule set.RuleSet.getPremises()
Returns all premises appearing in this rule set.Modifier and TypeMethodDescriptionstatic <S extends Rule<?,
?>>
Set<Derivation<S>> Derivation.allDerivations
(Collection<? extends S> rules, Formula conclusion) Returns the set of all possible derivations with the given conclusion from the set of rules.RuleSet.getRulesWithConclusion
(Formula f) Returns all rules this set with the given conclusionRuleSet.getSyntacticModule
(Formula f) Returns the maximal subset of this rule set that is closed under "syntactic" neighbourhood relationship for the given formula. -
Uses of Formula in org.tweetyproject.comparator
Modifier and TypeClassDescriptionclass
GeneralComparator<T extends Formula,
R extends BeliefBase> This abstract class is the common ancestor for semantical approaches to ranking, i.e.class
LatticePartialOrder<T extends Formula,
R extends BeliefBase> This class models comparable element ranking by representing the acceptability of comparable elements in a graph-based structure.class
NumericalPartialOrder<T extends Formula,
R extends BeliefBase> This class provides an acceptability interpretation of arguments by assigning them real values. -
Uses of Formula in org.tweetyproject.logics.bpm.parser.bpmn_to_petri
-
Uses of Formula in org.tweetyproject.logics.bpm.parser.xml_to_bpmn
-
Uses of Formula in org.tweetyproject.logics.bpm.syntax
Modifier and TypeClassDescriptionclass
A class to represent Activities in a BPMN Modelclass
A class to represent elements of a BPMN Modelclass
A class to represent parts of a BPMN Model as a formulaclass
A class to represent all kinds of nodes in a BPMN Modelclass
A class to represent end events in a BPMN Modelclass
A class to represent events of all kinds in a BPMN Modelclass
A class to represent exclusive gateways in a BPMN Modelclass
A class to represent gateways of all kinds in a BPMN Modelclass
A class to represent inclusive gateways in a BPMN Modelclass
A class to represent intermediate events of all kinds in a BPMN Modelclass
A class to represent lanes in a BPMN Modelclass
A class to represent processes in a BPMN Modelclass
A class to represent the starting events of a BPMN Modelclass
A class to represent tasks in a BPMN Model -
Uses of Formula in org.tweetyproject.logics.cl.syntax
Modifier and TypeClassDescriptionclass
This class represents a basic conditional (B|A) with formulas A,B. -
Uses of Formula in org.tweetyproject.logics.commons.analysis
Modifier and TypeClassDescriptionclass
AbstractBeliefSetConsistencyTester<T extends Formula>
Classes extending this abstract class are capable of testing whether a given belief set is consistent.class
AbstractMusEnumerator<S extends Formula>
Abstract implementation for MUes enumerators.interface
BeliefSetConsistencyTester<T extends Formula>
Classes extending this abstract class are capable of testing whether a given belief set is consistent.class
BeliefSetInconsistencyMeasure<S extends Formula>
Classes extending this abstract class represent inconsistency measures on belief sets.class
CcInconsistencyMeasure<S extends Formula>
This class implements the inconsistency measure I_CC from [Said Jabbour and Yue Ma and Badran Raddaoui.interface
ConsistencyWitnessProvider<B extends BeliefBase,
S extends Formula> Provides methods for returning some model (if it exists) of a set of formulas.class
CspInconsistencyMeasure<S extends Formula>
This class implements the inconsistency measure I_CSP from [Said Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi.interface
CulpabilityMeasure<S extends Formula,
T extends BeliefSet<S, ?>> Classes implementing this interface represent culpability measures, i.e.class
DfInconsistencyMeasure<S extends Formula>
This class implements the family of "Measures of the Degree of Inconsistency" from [Mu,Liu,Jin, Bell.class
DHitInconsistencyMeasure<T extends Interpretation<B,
S>, B extends BeliefBase, S extends Formula> This class implements the d-hit inconsistency measure from [Grant, Hunter.class
DMaxInconsistencyMeasure<T extends Interpretation<B,
S>, B extends BeliefBase, S extends Formula> This class implements the d-max inconsistency measure from [Grant, Hunter.class
DrasticInconsistencyMeasure<S extends Formula>
This class models the drastic inconsistency measure.class
DSumInconsistencyMeasure<T extends Interpretation<B,
S>, B extends BeliefBase, S extends Formula> This class implements the d-sum inconsistency measure from [Grant, Hunter.class
EtaInconsistencyMeasure<B extends BeliefBase,
S extends Formula> This class implements the Eta-inconsistency measure, cf.class
HsInconsistencyMeasure<B extends BeliefBase,
S extends Formula> This class implements the Hitting Set inconsistency measure as proposed in [Thimm, 2014, in preparation].class
InconsistencyMeasureEvaluator<T extends Formula,
U extends BeliefSet<T, ?>> This class provides functionality to quickly load or generate sample datasets and to use them to compare the results and performances of different inconsistency measure implementations.class
InconsistencyMeasureReport<T extends Formula,
U extends BeliefSet<T, ?>> This class summarizes the results of computing inconsistency values for some collection of knowledge bases using some set of inconsistency measures, including computation times and some statistics.interface
InterpolantEnumerator<S extends Formula>
Interface for classes enumerating (Craig) interpolants.class
IsInconsistencyMeasure<S extends Formula>
This class implements the inconsistency measure I_CSP from [Said Jabbour.class
MaInconsistencyMeasure<S extends Formula>
This class models the I_M inconsistency measure from e.g.class
McscInconsistencyMeasure<S extends Formula>
This class implements the approach of [Meriem Ammoura, Badran Raddaoui, Yakoub Salhi, Brahim Oukacha.class
MicInconsistencyMeasure<S extends Formula>
This class models the MI^C inconsistency measure.class
MiInconsistencyMeasure<S extends Formula>
This class models the MI inconsistency measure.interface
MusEnumerator<S extends Formula>
Interface for classes enumerating MUSes (minimal unsatisfiable sets) and MCSs (maximal consistent sets).class
NaiveMusEnumerator<S extends Formula>
A simple approach to compute minimal inconsistent subsets and maximal consistent subsets by exhaustive search.class
NConsInconsistencyMeasure<S extends Formula>
This class implements an inconsistency measure based on "n-consistency" proposed in [Doder,Raskovic,Markovic,Ognjanovic.class
NormalizedMicInconsistencyMeasure<S extends Formula>
This class models the normalized MI^C inconsistency measure, see [PhD thesis, Thimm].class
NormalizedMiInconsistencyMeasure<S extends Formula>
This class models the normalized MI inconsistency measure, see [PhD thesis, Thimm].class
PrInconsistencyMeasure<S extends Formula>
This class models the P inconsistency measure from e.g.class
ShapleyCulpabilityMeasure<S extends Formula,
T extends BeliefSet<S, ?>> This class implements the Shapley culpability measure. -
Uses of Formula in org.tweetyproject.logics.commons.analysis.streams
Modifier and TypeClassDescriptionclass
DefaultStreamBasedInconsistencyMeasure<S extends Formula>
Implements a stream-based inconsistency measure on a given class of inconsistency measurement processes.class
InconsistencyMeasurementProcess<S extends Formula>
The actual process of an inconsistency measure on streams.class
StreamBasedInconsistencyMeasure<S extends Formula>
General interface for inconsistency measures working on streams.class
WindowInconsistencyMeasurementProcess<S extends Formula>
This inconsistency measurement process keeps a window of a number of previous formulas in memory and computes the inconsistency value from this window using an ordinary inconsistency measure.ModifierConstructorDescriptionInconsistencyUpdateEvent
(StreamBasedInconsistencyMeasure<?> measure, InconsistencyMeasurementProcess<?> process, Double inconsistencyValue, Formula f) Creates a new event with the given parameters. -
Uses of Formula in org.tweetyproject.logics.commons.syntax
Modifier and TypeClassDescriptionclass
AssociativeFormulaSupport<T extends SimpleLogicalFormula>
This class provides common implementation for associative formulas that are formulas which consists of several other formulas.class
Abstract base class for ComplexLogicalFormula, that are formulas which implement substitute(), exchange(), getTerms(), isGround() and isWellFormed() and therefore use terms to describe themself.class
This is the abstract base class for relational formulas, i.e. -
Uses of Formula in org.tweetyproject.logics.commons.syntax.interfaces
Modifier and TypeInterfaceDescriptioninterface
LogicProgram<C extends Formula,
P extends Formula, T extends Rule<?, ?>> An interface for a logic program, which is a set of rules.interface
LogicProgram<C extends Formula,
P extends Formula, T extends Rule<?, ?>> An interface for a logic program, which is a set of rules.Modifier and TypeInterfaceDescriptioninterface
AssociativeFormula<T extends SimpleLogicalFormula>
This interfaces describes associative formulas like a disjunction or a conjunction.interface
An atomic language construct, linked to its predicateinterface
This interface models a classical formula, i.e.interface
A complex logical formula can contain arguments referred as terms, this interface provides methods to substitute and exchange those terms.interface
Formulas implementing this interface can be connected by using AND.interface
Formulas implementing this interface can be connected using OR.interface
Formulas implementing this interface have a complementinterface
Interface for a QuantifiedFormula with a set of quantified variables implementing an all- or exist-quantor for example.interface
A formula of a logical language -
Uses of Formula in org.tweetyproject.logics.dl.syntax
Modifier and TypeClassDescriptionclass
Abstract base class for assertional axioms (concept assertions and role assertions) in description logic.class
This class captures the common functionalities of description logic associative formulas (union and intersection).class
This class models an atomic concept (aka concept name) in description logics.class
This class models a role in description logics.class
This class models the bottom concept (empty concept) in description logics.class
This class models the complement (negation) in description logics.class
The common abstract class for concepts (also called concepts, complex concepts or concept descriptions) of description logics.class
This class models a concept assertion in description logic, i.e.class
The common abstract class for axioms of the description logic ALC.class
This class models an equivalence axiom, also known as "general concept inclusion" (GCU), meaning an expression of the form "C is a subset of or equal to D" where C and D are concepts.class
This class models an existential restriction in description logics, i.e.class
This class models an intersection in description logics.class
This class models a role assertion in description logic, i.e.class
This class models the top concept (universal concept) in description logics.class
This class models an union in description logics.class
This class models an universal restriction in description logics, i.e. -
Uses of Formula in org.tweetyproject.logics.fol.reasoner
Modifier and TypeMethodDescriptionSpassFolReasoner.queryProof
(FolBeliefSet kb, Formula query) Determines the answer wrt. -
Uses of Formula in org.tweetyproject.logics.fol.syntax
Modifier and TypeClassDescriptionclass
This class captures the common functionalities first order associative formulas like conjunction, disjunction, etc.class
The classical conjunction of first-order logic.class
A contradictory formula.class
The classical disjunction of first-order logic.class
The equivalence of first-order logic.class
The exclusive disjunction (XOR) in first-order logic.class
Exists-quantified first-order logic formula.class
An atom in first-order logic, i.e.class
The common abstract class for formulas of first-order logic.class
For-All-quantified first-order logic formula.class
The implication of first-order logic.class
The classical negation of first-order logic.class
This class captures the common functionalities of the special formulas tautology and contradiction.class
A tautological formula. -
Uses of Formula in org.tweetyproject.logics.ml.reasoner
Modifier and TypeMethodDescriptionSPASSMlReasoner.queryProof
(MlBeliefSet kb, Formula query) Determines the answer wrt. -
Uses of Formula in org.tweetyproject.logics.ml.semantics
Modifier and TypeMethodDescriptionboolean
MlHerbrandInterpretation.satisfies
(Formula formula, Set<Interpretation<FolBeliefSet, FolFormula>> successors) Checks whether this Herbrand interpretation satisfies the given formula. -
Uses of Formula in org.tweetyproject.logics.ml.syntax
Modifier and TypeClassDescriptionclass
This class models a modal formula, i.e.class
This class models the necessity modality.class
This class models the possibility modality. -
Uses of Formula in org.tweetyproject.logics.mln.syntax
Modifier and TypeClassDescriptionclass
Instances of this class represent first-order formulas with a weight. -
Uses of Formula in org.tweetyproject.logics.pcl.syntax
Modifier and TypeClassDescriptionclass
This class represents a probabilistic conditional of the form (B|A)[p] with formulas A,B and a probability p. -
Uses of Formula in org.tweetyproject.logics.petri.syntax.reachability_graph
-
Uses of Formula in org.tweetyproject.logics.pl.analysis
Modifier and TypeInterfaceDescriptioninterface
MinimalModelProvider<A extends Formula,
B extends BeliefBase, C extends Formula> MinimalModelProvider classinterface
MinimalModelProvider<A extends Formula,
B extends BeliefBase, C extends Formula> MinimalModelProvider class -
Uses of Formula in org.tweetyproject.logics.pl.semantics
Modifier and TypeMethodDescriptionPossibleWorldIterator.reset
(Collection<? extends Formula> formulas) -
Uses of Formula in org.tweetyproject.logics.pl.syntax
Modifier and TypeClassDescriptionclass
This class captures the common functionalities of formulas with an associative operation like conjunction, disjunction, etc.class
This class represents a conjunction in propositional logic.class
A contradictory formula.class
This class represents a disjunction in propositional logic.class
This class models equivalence of propositional logic.class
This class represents an exclusive disjunction (XOR) in propositional logic.class
This class models the implication of propositional logic.class
This class models classical negation of propositional logic.class
This class represents the common ancestor for propositional formulae.class
This class represents a simple proposition in propositional logic.class
This class captures the common functionalities of the special formulas tautology and contradiction.class
A tautological formula. -
Uses of Formula in org.tweetyproject.logics.qbf.syntax
Modifier and TypeClassDescriptionclass
This class represents existential quantification for boolean formulas.class
This class represents universal quantification for boolean formulas. -
Uses of Formula in org.tweetyproject.logics.rcl.syntax
Modifier and TypeClassDescriptionclass
Instances of this class represent relational conditionals. -
Uses of Formula in org.tweetyproject.logics.rdl.parser
-
Uses of Formula in org.tweetyproject.logics.rdl.syntax
Modifier and TypeClassDescriptionclass
Models a default rule in Reiter's default logic, see [R. -
Uses of Formula in org.tweetyproject.logics.rpcl.syntax
Modifier and TypeClassDescriptionclass
This class represents a relational probabilistic conditional, i.e. -
Uses of Formula in org.tweetyproject.logics.translators.adfconditional
Modifier and TypeMethodDescriptionFourValuedWorldIterator.reset
(Collection<? extends Formula> formulas) -
Uses of Formula in org.tweetyproject.logics.translators.adfrevision
Modifier and TypeClassDescriptionclass
This class models an indecision operator for 3-valued propositional logic as proposed in [Heyninck 2020] Indecision(a) is true, if formula a is undecided Indecision(a) is false, if formula a is true or false Adapted from the class "Negation"class
This class models a weak negation for 3-valued propositional logic as proposed in [Heyninck 2020] Adapted from the class "Negation"Modifier and TypeMethodDescriptionPriestWorldIterator.reset
(Collection<? extends Formula> formulas) -
Uses of Formula in org.tweetyproject.lp.asp.beliefdynamics.baserevision
Modifier and TypeInterfaceDescriptioninterface
ConsolidationOperator<T extends Formula>
This interface represents an consolidation operator for belief bases as defined in [KKI12].class
RemainderSets<T extends Formula>
This class represents the set of remainder sets constructed from a belief base.interface
SelectionFunction<T extends Formula>
This interface models a general selection function for remainder sets -
Uses of Formula in org.tweetyproject.lp.asp.syntax
Modifier and TypeClassDescriptionclass
This class represents an aggregate.class
This class models an aggregate element, meaning a set of terms and a set of naf literals (= literals or default negated literals).class
This class is a variant of the basic ASP rule head.class
This class models an atom, which is a basic structure for building literals and rules for logic programs.class
This class is a common base class for ASP formulas that can be part of an ASP rule body (premise of a rule): Literals (i.e.class
This class acts as an abstract base class for elements of ASP rules.class
This class is a common base class for ASP formulas that can be part of an ASP rule head.class
This class defines common functionality for literals, meaning atoms or strictly negated atoms.class
This class models a rule in ASP.class
This class represents an element of a choice atom.class
This class is a variant of the basic ASP rule head.class
This formula represents the head of an disjunctive rule which is a disjunction of literals.class
This class represents a comparative atom, meaning an expression of the form 't x u' where t,u are terms and x is in {<, <=, ==, !=, >, >=}.class
This class represents a default negated literal, i.e.class
This class represents an element of an optimization statement, meaning a term-literal tuple that is associated with a weight and optionally a priority (level).class
This class represents an optimization statement.class
This class models the strict negation of an atom (as opposed to a default negation:DefaultNegation
). -
Uses of Formula in org.tweetyproject.lp.nlp.syntax
-
Uses of Formula in org.tweetyproject.web.services.aba
Modifier and TypeClassDescriptionclass
AbaReasonerGetModelCallee<T extends Formula>
The AbaReasonerGetModelCallee class extends the Callee class and represents a callee responsible for obtaining some model from an Argumentation-Based Argumentation (ABA) reasoner.class
AbaReasonerGetModelsCallee<T extends Formula>
The AbaReasonerGetModelsCallee class extends the Callee class and represents a callee responsible for obtaining multiple models from an Argumentation-Based Argumentation (ABA) reasoner.class
AbaReasonerQueryCallee<T extends Formula>
The AbaReasonerQueryCallee class extends the Callee class and represents a callee responsible for querying an assumption in Argumentation-Based Argumentation (ABA).Modifier and TypeMethodDescriptionAbaReasonerCalleeFactory.getCallee
(AbaReasonerCalleeFactory.Command cmd, GeneralAbaReasoner<T> reasoner, AbaTheory<T> bbase, Assumption<T> a) Creates a new callee instance based on the provided command, ABA reasoner, ABA theory, and assumption. -
Uses of Formula in org.tweetyproject.web.services.delp
ModifierConstructorDescriptionDeLPCallee
(DefeasibleLogicProgram delp, DelpReasoner reasoner, Formula f) Constructs a new DeLPCallee with the specified DefeasibleLogicProgram, DelpReasoner, and Formula.