Uses of Interface
net.sf.tweety.commons.Formula

Packages that use Formula

Package	Description
net.sf.tweety.action.description.parser
net.sf.tweety.action.description.syntax
net.sf.tweety.action.query.syntax
net.sf.tweety.action.signature
net.sf.tweety.arg.aba.parser
net.sf.tweety.arg.aba.reasoner
net.sf.tweety.arg.aba.semantics
net.sf.tweety.arg.aba.syntax
net.sf.tweety.arg.adf.parser
net.sf.tweety.arg.aspic.parser
net.sf.tweety.arg.aspic.semantics
net.sf.tweety.arg.aspic.syntax
net.sf.tweety.arg.bipolar.syntax
net.sf.tweety.arg.deductive.syntax
net.sf.tweety.arg.delp.parser
net.sf.tweety.arg.delp.syntax
net.sf.tweety.arg.dung.ldo.syntax
net.sf.tweety.arg.dung.parser
net.sf.tweety.arg.dung.syntax
net.sf.tweety.arg.lp.syntax
net.sf.tweety.arg.saf.syntax
net.sf.tweety.beliefdynamics
net.sf.tweety.beliefdynamics.gui
net.sf.tweety.beliefdynamics.kernels
net.sf.tweety.beliefdynamics.mas
net.sf.tweety.beliefdynamics.selectiverevision
net.sf.tweety.commons
net.sf.tweety.commons.analysis
net.sf.tweety.commons.postulates
net.sf.tweety.commons.streams
net.sf.tweety.commons.util.rules
net.sf.tweety.logics.bpm.syntax
net.sf.tweety.logics.cl.syntax
net.sf.tweety.logics.commons.analysis
net.sf.tweety.logics.commons.analysis.streams
net.sf.tweety.logics.commons.syntax
net.sf.tweety.logics.commons.syntax.interfaces
net.sf.tweety.logics.dl.syntax
net.sf.tweety.logics.fol.reasoner
net.sf.tweety.logics.fol.syntax
net.sf.tweety.logics.ml.reasoner
net.sf.tweety.logics.ml.semantics
net.sf.tweety.logics.ml.syntax
net.sf.tweety.logics.mln.syntax
net.sf.tweety.logics.pcl.syntax
net.sf.tweety.logics.pl.semantics
net.sf.tweety.logics.pl.syntax
net.sf.tweety.logics.qbf.syntax
net.sf.tweety.logics.rcl.syntax
net.sf.tweety.logics.rdl.parser
net.sf.tweety.logics.rdl.syntax
net.sf.tweety.logics.rpcl.syntax
net.sf.tweety.lp.asp.beliefdynamics.baserevision
net.sf.tweety.lp.asp.syntax
net.sf.tweety.lp.nlp.syntax

Uses of Formula in net.sf.tweety.action.description.parser

Methods in net.sf.tweety.action.description.parser that return Formula

Modifier and Type	Method	Description
Formula	CLawParser.parseFormula(java.io.Reader reader)
Formula	CLawParser.parseFormula(java.lang.String s)
Formula	CParser.parseFormula(java.io.Reader reader)
Formula	CParser.parseFormula(java.lang.String formula)

Uses of Formula in net.sf.tweety.action.description.syntax

Subinterfaces of Formula in net.sf.tweety.action.description.syntax

Modifier and Type	Interface	Description
interface	CausalLaw	A basic interface representing a causal law.

Classes in net.sf.tweety.action.description.syntax that implement Formula

Modifier and Type	Class	Description
class	CLaw	The action description language C consists of two distinct expressions: static laws and dynamic laws.
class	DynamicLaw	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	StaticLaw	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 net.sf.tweety.action.query.syntax

Subinterfaces of Formula in net.sf.tweety.action.query.syntax

Modifier and Type	Interface	Description
interface	ActionQuery	This is a basic interface for action queries.

Classes in net.sf.tweety.action.query.syntax that implement Formula

Modifier and Type	Class	Description
class	AlwaysQuery	This class represents an always query in the action query language S.
class	HoldsQuery	This class represents a holds query in the action query language S.
class	NecessarilyQuery	This class represents a necessarily query in the action query language S.
class	QueryProposition	Action queries are represented as propositional formulas with three possible types of propositions: holds, always and necessarily propositions.
class	SActionQuery	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 net.sf.tweety.action.signature

Methods in net.sf.tweety.action.signature with parameters of type Formula

Modifier and Type	Method	Description
boolean	ActionSignature.isValidFormula(Formula f)	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.

Uses of Formula in net.sf.tweety.arg.aba.parser

Classes in net.sf.tweety.arg.aba.parser with type parameters of type Formula

Modifier and Type	Class	Description
class	AbaParser<T extends Formula>	Parses a Assumption Based Argumentation System out of an input text.

Methods in net.sf.tweety.arg.aba.parser that return Formula

Modifier and Type	Method	Description
Formula	AbaParser.parseFormula(java.io.Reader reader)

Constructor parameters in net.sf.tweety.arg.aba.parser with type arguments of type Formula

Constructor	Description
AbaParser(Parser<? extends BeliefBase,? extends Formula> formulaparser)	Creates a new ABA parser

Uses of Formula in net.sf.tweety.arg.aba.reasoner

Classes in net.sf.tweety.arg.aba.reasoner with type parameters of type Formula

Modifier and Type	Class	Description
class	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 net.sf.tweety.arg.aba.semantics

Classes in net.sf.tweety.arg.aba.semantics with type parameters of type Formula

Modifier and Type	Class	Description
class	AbaAttack<T extends Formula>	This class models an ABA attack.
class	AbaExtension<T extends Formula>	This class models an ABA Extension, meaning a set of assumptions.

Classes in net.sf.tweety.arg.aba.semantics that implement Formula

Modifier and Type	Class	Description
class	AbaAttack<T extends Formula>	This class models an ABA attack.

Methods in net.sf.tweety.arg.aba.semantics with type parameters of type Formula

Modifier and Type	Method	Description
static <T extends Formula> java.util.Collection<AbaAttack<T>>	AbaAttack.allAttacks(java.util.Collection<Assumption<T>> from, java.util.Collection<Assumption<T>> to, AbaTheory<T> abat)	Returns all attacks from the given attacking set to the given attacked set.
static <T extends Formula> java.util.Collection<AbaAttack<T>>	AbaAttack.allAttacks(AbaTheory<T> abat)	Returns all attacks between arguments in the given AbaTheory.

Uses of Formula in net.sf.tweety.arg.aba.syntax

Classes in net.sf.tweety.arg.aba.syntax with type parameters of type Formula

Modifier and Type	Class	Description
class	AbaElement<T extends Formula>	Abstract class that models common properties of aba syntax elements.
class	AbaRule<T extends Formula>	A common interface for assumptions and inference rules.
class	AbaTheory<T extends Formula>	An implementation of Assumption Based Argumentation.
class	Assumption<T extends Formula>	This class models an assumption of an ABA theory.
class	Deduction<T extends Formula>	An argument derived from an ABA theory.
class	InferenceRule<T extends Formula>	This class models an inference rule from an ABA theory.
class	Negation<T extends Formula>

Classes in net.sf.tweety.arg.aba.syntax that implement Formula

Modifier and Type	Class	Description
class	AbaElement<T extends Formula>	Abstract class that models common properties of aba syntax elements.
class	AbaRule<T extends Formula>	A common interface for assumptions and inference rules.
class	Assumption<T extends Formula>	This class models an assumption of an ABA theory.
class	Deduction<T extends Formula>	An argument derived from an ABA theory.
class	InferenceRule<T extends Formula>	This class models an inference rule from an ABA theory.
class	Negation<T extends Formula>

Methods in net.sf.tweety.arg.aba.syntax with parameters of type Formula

Modifier and Type	Method	Description
void	AbaTheory.add(Formula rule)
void	AbaTheory.add(Formula... rules)

Uses of Formula in net.sf.tweety.arg.adf.parser

Methods in net.sf.tweety.arg.adf.parser that return Formula

Modifier and Type	Method	Description
Formula	KppADFFormatParser.parseFormula(java.io.Reader reader)

Uses of Formula in net.sf.tweety.arg.aspic.parser

Methods in net.sf.tweety.arg.aspic.parser that return Formula

Modifier and Type	Method	Description
Formula	AspicParser.parseFormula(java.io.Reader reader)

Constructor parameters in net.sf.tweety.arg.aspic.parser with type arguments of type Formula

Constructor	Description
AspicParser(Parser<? extends BeliefBase,? extends Formula> formulaparser, RuleFormulaGenerator<T> rfg)	Constructs a new instance

Uses of Formula in net.sf.tweety.arg.aspic.semantics

Classes in net.sf.tweety.arg.aspic.semantics that implement Formula

Modifier and Type	Class	Description
class	AspicAttack<T extends Invertable>

Uses of Formula in net.sf.tweety.arg.aspic.syntax

Classes in net.sf.tweety.arg.aspic.syntax that implement Formula

Modifier and Type	Class	Description
class	AspicArgument<T extends Invertable>
class	DefeasibleInferenceRule<T extends Invertable>
class	InferenceRule<T extends Invertable>
class	StrictInferenceRule<T extends Invertable>

Uses of Formula in net.sf.tweety.arg.bipolar.syntax

Subinterfaces of Formula in net.sf.tweety.arg.bipolar.syntax

Modifier and Type	Interface	Description
interface	Attack	This interface captures common methods of different interpretations of the attack relation in bipolar abstract argumentation theories.
interface	BipolarEntity	This interface captures common methods of arguments and argument sets of bipolar abstract argumentation theories.
interface	Support	This interface captures common methods of different interpretations of the support relation in bipolar abstract argumentation theories.

Classes in net.sf.tweety.arg.bipolar.syntax that implement Formula

Modifier and Type	Class	Description
class	ArgumentSet	This class models a set of arguments used by bipolar abstract argumentation theory.
class	BArgument	This class models an argument used by bipolar abstract argumentation theories.
class	BinaryAttack	This class models a binary attack relation between two arguments.
class	BinarySupport	This class models a support between two arguments.
class	SetAttack	This class models an attack between a set of arguments and an argument.
class	SetSupport	This class models a support between a set of arguments and an argument.

Uses of Formula in net.sf.tweety.arg.deductive.syntax

Classes in net.sf.tweety.arg.deductive.syntax that implement Formula

Modifier and Type	Class	Description
class	SimplePlLogicArgument
class	SimplePlRule	Basic data structure for handling simple rule

Uses of Formula in net.sf.tweety.arg.delp.parser

Methods in net.sf.tweety.arg.delp.parser that return Formula

Modifier and Type	Method	Description
Formula	DelpParser.parseFormula(java.io.Reader reader)

Uses of Formula in net.sf.tweety.arg.delp.syntax

Classes in net.sf.tweety.arg.delp.syntax that implement Formula

Modifier and Type	Class	Description
class	DefeasibleRule	This class models a defeasible rule in defeasible logic programming.
class	DelpArgument	This class models a DeLP argument which comprises of a set of defeasible rules (the support) and a literal (the conclusion).
class	DelpFact	This class implements a fact in defeasible logic programming which encapsulates a literal.
class	DelpRule	This method is the superclass for both a strict rule and a defeasible rule in defeasible logic programming and captures their common attributes and methods.
class	StrictRule	This class models a strict rule in defeasible logic programming.

Uses of Formula in net.sf.tweety.arg.dung.ldo.syntax

Classes in net.sf.tweety.arg.dung.ldo.syntax that implement Formula

Modifier and Type	Class	Description
class	AbstractGraphLdoModality	Provides common functionalities for the graph-based modalities in LDO.
class	AbstractLdoModality	Provides common functionalities for all modalities in LDO.
class	LdoArgument	This class represents an argument in ldo.
class	LdoAssociativeFormula	This class captures the common functionalities of formulas with an associative operation like conjunction, disjunction, etc.
class	LdoBoxModality
class	LdoConjunction	This class represents a conjunction in ldo logic.
class	LdoDiamondModality
class	LdoDisjunction	This class represents a disjunction in ldo logic.
class	LdoFormula	This abstract class specifies the general methods of all Ldo-formulas (LDO - Logic of dialectical outcomes, cf.
class	LdoGraphBoxModality
class	LdoGraphDiamondModality
class	LdoNegation	This class models classical negation of ldo logic.
class	LdoRelation	Creates a relational formula, i.e.

Uses of Formula in net.sf.tweety.arg.dung.parser

Methods in net.sf.tweety.arg.dung.parser that return Formula

Modifier and Type	Method	Description
Formula	AbstractDungParser.parseFormula(java.io.Reader reader)

Uses of Formula in net.sf.tweety.arg.dung.syntax

Subinterfaces of Formula in net.sf.tweety.arg.dung.syntax

Modifier and Type	Interface	Description
interface	DungEntity	This interface captures common methods of arguments and attacks of abstract argumentation theories.

Classes in net.sf.tweety.arg.dung.syntax that implement Formula

Modifier and Type	Class	Description
class	Argument	This class models an argument used by Dung's abstract argumentation theory and is just described by its name.
class	Attack	This class models an attack between two arguments.

Uses of Formula in net.sf.tweety.arg.lp.syntax

Classes in net.sf.tweety.arg.lp.syntax that implement Formula

Modifier and Type	Class	Description
class	Argument	Instances of this class represent arguments in the sense of Definition 2 in [1].

Uses of Formula in net.sf.tweety.arg.saf.syntax

Classes in net.sf.tweety.arg.saf.syntax that implement Formula

Modifier and Type	Class	Description
class	ArgumentStructure	This class models an argument structure, i.e.
class	BasicArgument	This class models a basic argument in structured argumentation frameworks, i.e.

Uses of Formula in net.sf.tweety.beliefdynamics

Classes in net.sf.tweety.beliefdynamics with type parameters of type Formula

Modifier and Type	Interface	Description
interface	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 net.sf.tweety.beliefdynamics.gui

Methods in net.sf.tweety.beliefdynamics.gui that return types with arguments of type Formula

Modifier and Type	Method	Description
java.util.Collection<? extends Formula>	RevisionComparePresenter.FileHandler.load(java.io.File file)

Method parameters in net.sf.tweety.beliefdynamics.gui with type arguments of type Formula

Modifier and Type	Method	Description
void	RevisionCompareModel.addBeliefbase(java.util.Collection<? extends Formula> beliefBase)	Adds a belief base to the end of the ordered list of belief bases.

Uses of Formula in net.sf.tweety.beliefdynamics.kernels

Classes in net.sf.tweety.beliefdynamics.kernels with type parameters of type Formula

Modifier and Type	Interface	Description
interface	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 net.sf.tweety.beliefdynamics.mas

Classes in net.sf.tweety.beliefdynamics.mas with type parameters of type Formula

Modifier and Type	Class	Description
class	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.

Classes in net.sf.tweety.beliefdynamics.mas that implement Formula

Modifier and Type	Class	Description
class	InformationObject<T extends Formula>	This class represents a formula annotated with the source of the formula.

Uses of Formula in net.sf.tweety.beliefdynamics.selectiverevision

Classes in net.sf.tweety.beliefdynamics.selectiverevision with type parameters of type Formula

Modifier and Type	Class	Description
class	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 net.sf.tweety.commons

Classes in net.sf.tweety.commons with type parameters of type Formula

Modifier and Type	Class	Description
class	AbstractInterpretation<B extends BeliefBase,S extends Formula>	An abstract interpretation for some logical language.
class	BeliefSet<T extends Formula,S extends Signature>	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>	The general interface for objects that are able to query a belief base with some formula and return either TRUE or FALSE as answer.
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.

Methods in net.sf.tweety.commons with parameters of type Formula

Modifier and Type	Method	Description
boolean	BeliefSet.add(T... formulas)	Adds the specified elements to the end of this collection (optional operation).
boolean	InterpretationSet.add(T... elements)	Adds the specified elements to the end of this collection (optional operation).

Method parameters in net.sf.tweety.commons with type arguments of type Formula

Modifier and Type	Method	Description
InterpretationIterator<S,B,T>	InterpretationIterator.reset(java.util.Collection<? extends Formula> formulas)	Initializes a new reseted iterator for the given signature derived from the given set of formulas.

Uses of Formula in net.sf.tweety.commons.analysis

Classes in net.sf.tweety.commons.analysis with type parameters of type Formula

Modifier and Type	Class	Description
class	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 net.sf.tweety.commons.postulates

Classes in net.sf.tweety.commons.postulates with type parameters of type Formula

Modifier and Type	Interface	Description
interface	Postulate<S extends Formula>	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 net.sf.tweety.commons.streams

Classes in net.sf.tweety.commons.streams with type parameters of type Formula

Modifier and Type	Class	Description
class	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 net.sf.tweety.commons.util.rules

Classes in net.sf.tweety.commons.util.rules with type parameters of type Formula

Modifier and Type	Interface	Description
interface	Rule<C extends Formula,P extends Formula>	This interface models a general rule, i.e.
interface	Rule<C extends Formula,P extends Formula>	This interface models a general rule, i.e.

Subinterfaces of Formula in net.sf.tweety.commons.util.rules

Modifier and Type	Interface	Description
interface	Rule<C extends Formula,P extends Formula>	This interface models a general rule, i.e.

Methods in net.sf.tweety.commons.util.rules that return Formula

Modifier and Type	Method	Description
Formula	Derivation.getConclusion()	Returns the conclusion of this derivation.

Methods in net.sf.tweety.commons.util.rules that return types with arguments of type Formula

Modifier and Type	Method	Description
java.util.Set<Formula>	RuleSet.getConclusions()	Returns all conclusions of all rules of this rule set.
java.util.Set<Formula>	RuleSet.getPremises()	Returns all premises appearing in this rule set.

Methods in net.sf.tweety.commons.util.rules with parameters of type Formula

Modifier and Type	Method	Description
static <S extends Rule<?,?>> java.util.Set<Derivation<S>>	Derivation.allDerivations(java.util.Collection<? extends S> rules, Formula conclusion)	Returns the set of all possible derivations with the given conclusion from the set of rules.
java.util.Set<T>	RuleSet.getRulesWithConclusion(Formula f)	Returns all rules this set with the given conclusion
RuleSet<T>	RuleSet.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 net.sf.tweety.logics.bpm.syntax

Classes in net.sf.tweety.logics.bpm.syntax that implement Formula

Modifier and Type	Class	Description
class	Activity
class	BpmnElement
class	BpmnFormula
class	BpmnNode
class	EndEvent
class	Event
class	Gateway
class	IntermediateEvent
class	StartEvent
class	Subprocess
class	Task

Uses of Formula in net.sf.tweety.logics.cl.syntax

Classes in net.sf.tweety.logics.cl.syntax that implement Formula

Modifier and Type	Class	Description
class	Conditional	This class represents a basic conditional (B|A) with formulas A,B.

Uses of Formula in net.sf.tweety.logics.commons.analysis

Classes in net.sf.tweety.logics.commons.analysis with type parameters of type Formula

Modifier and Type	Class	Description
class	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].
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 net.sf.tweety.logics.commons.analysis.streams

Classes in net.sf.tweety.logics.commons.analysis.streams with type parameters of type Formula

Modifier and Type	Class	Description
class	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.

Constructors in net.sf.tweety.logics.commons.analysis.streams with parameters of type Formula

Constructor	Description
InconsistencyUpdateEvent(StreamBasedInconsistencyMeasure<?> measure, InconsistencyMeasurementProcess<?> process, java.lang.Double inconsistencyValue, Formula f)	Creates a new event with the given parameters.

Uses of Formula in net.sf.tweety.logics.commons.syntax

Classes in net.sf.tweety.logics.commons.syntax that implement Formula

Modifier and Type	Class	Description
class	AssociativeFormulaSupport<T extends SimpleLogicalFormula>	This class provides common implementation for associative formulas that are formulas which consists of several other formulas.
class	ComplexLogicalFormulaAdapter	Abstract base class for ComplexLogicalFormula, that are formulas which implement substitute(), exchange(), getTerms(), isGround() and isWellFormed() and therefore use terms to describe themself.
class	RelationalFormula	This is the abstract base class for relational formulas, i.e.

Uses of Formula in net.sf.tweety.logics.commons.syntax.interfaces

Classes in net.sf.tweety.logics.commons.syntax.interfaces with type parameters of type Formula

Modifier and Type	Interface	Description
interface	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.

Subinterfaces of Formula in net.sf.tweety.logics.commons.syntax.interfaces

Modifier and Type	Interface	Description
interface	AssociativeFormula<T extends SimpleLogicalFormula>	This interfaces describes associative formulas like a disjunction or a conjunction.
interface	Atom	An atomic language construct, linked to its predicate
interface	ClassicalFormula	This interface models a classical formula, i.e.
interface	ComplexLogicalFormula	A complex logical formula can contain arguments referred as terms, this interface provides methods to substitute and exchange those terms.
interface	Conjunctable	Formulas implementing this interface can be connected by using AND.
interface	Disjunctable	Formulas implementing this interface can be connected using OR.
interface	Invertable	Formulas implementing this interface have a complement
interface	QuantifiedFormula	Interface for a QuantifiedFormula with a set of quantified variables implementing an all- or exist-quantor for example.
interface	SimpleLogicalFormula	A formula of a logical language

Methods in net.sf.tweety.logics.commons.syntax.interfaces with parameters of type Formula

Modifier and Type	Method	Description
void	LogicProgram.addFacts(C... facts)	Adds the given facts to the program

Uses of Formula in net.sf.tweety.logics.dl.syntax

Classes in net.sf.tweety.logics.dl.syntax that implement Formula

Modifier and Type	Class	Description
class	AssertionalAxiom	Abstract base class for assertional axioms (concept assertions and role assertions).
class	AssociativeDlFormula	This class captures the common functionalities of description logic associative formulas (union and intersection).
class	AtomicConcept	This class models an atomic concept (aka concept name) in description logics.
class	AtomicRole	This class models a role in description logics.
class	BottomConcept	This class models the bottom concept (empty concept) in description logics.
class	Complement	This class models the complement (negation) in description logics.
class	ComplexConcept	The common abstract class for concepts (also called concepts, complex concepts or concept descriptions) of description logics.
class	ConceptAssertion	This class models a concept assertion in description logic, i.e.
class	DlAxiom	The common abstract class for axioms of the description logic ALC.
class	EquivalenceAxiom	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" with C and D as Concepts.
class	ExistentialRestriction	This class models an existential restriction in description logics, i.e.
class	Intersection	This class models an intersection in description logics.
class	RoleAssertion	This class models a role assertion in description logic, i.e.
class	TopConcept	This class models the top concept (universal concept) in description logics.
class	Union	This class models an union in description logics.
class	UniversalRestriction	This class models an universal restriction in description logics, i.e.

Uses of Formula in net.sf.tweety.logics.fol.reasoner

Methods in net.sf.tweety.logics.fol.reasoner with parameters of type Formula

Modifier and Type	Method	Description
java.lang.String	SpassFolReasoner.queryProof(FolBeliefSet kb, Formula query)	Determines the answer wrt.

Uses of Formula in net.sf.tweety.logics.fol.syntax

Classes in net.sf.tweety.logics.fol.syntax that implement Formula

Modifier and Type	Class	Description
class	AssociativeFolFormula	This class captures the common functionalities first order associative formulas like conjunction, disjunction, etc.
class	Conjunction	The classical conjunction of first-order logic.
class	Contradiction	A contradictory formula.
class	Disjunction	The classical disjunction of first-order logic.
class	Equivalence	The equivalence of first-order logic.
class	ExclusiveDisjunction	The exclusive disjunction (XOR) in first-order logic.
class	ExistsQuantifiedFormula	Exists-quantified first-order logic formula.
class	FolAtom	An atom in first-order logic, i.e.
class	FolFormula	The common abstract class for formulas of first-order logic.
class	ForallQuantifiedFormula	For-All-quantified first-order logic formula.
class	Implication	The implication of first-order logic.
class	Negation	The classical negation of first-order logic.
class	SpecialFormula	This class captures the common functionalities of the special formulas tautology and contradiction.
class	Tautology	A tautological formula.

Uses of Formula in net.sf.tweety.logics.ml.reasoner

Methods in net.sf.tweety.logics.ml.reasoner with parameters of type Formula

Modifier and Type	Method	Description
java.lang.String	SPASSMlReasoner.queryProof(MlBeliefSet kb, Formula query)	Determines the answer wrt.

Uses of Formula in net.sf.tweety.logics.ml.semantics

Methods in net.sf.tweety.logics.ml.semantics with parameters of type Formula

Modifier and Type	Method	Description
boolean	MlHerbrandInterpretation.satisfies(Formula formula, java.util.Set<Interpretation<FolBeliefSet,FolFormula>> successors)	Checks whether this Herbrand interpretation satisfies the given formula.

Uses of Formula in net.sf.tweety.logics.ml.syntax

Classes in net.sf.tweety.logics.ml.syntax that implement Formula

Modifier and Type	Class	Description
class	MlFormula	This class models a modal formula, i.e.
class	Necessity	This class models the necessity modality.
class	Possibility	This class models the possibility modality.

Uses of Formula in net.sf.tweety.logics.mln.syntax

Classes in net.sf.tweety.logics.mln.syntax that implement Formula

Modifier and Type	Class	Description
class	MlnFormula	Instances of this class represent first-order formulas with a weight.

Uses of Formula in net.sf.tweety.logics.pcl.syntax

Classes in net.sf.tweety.logics.pcl.syntax that implement Formula

Modifier and Type	Class	Description
class	ProbabilisticConditional	This class represents a probabilistic conditional of the form (B|A)[p] with formulas A,B and a probability p.

Uses of Formula in net.sf.tweety.logics.pl.semantics

Method parameters in net.sf.tweety.logics.pl.semantics with type arguments of type Formula

Modifier and Type	Method	Description
InterpretationIterator<PlFormula,PlBeliefSet,PossibleWorld>	PossibleWorldIterator.reset(java.util.Collection<? extends Formula> formulas)

Uses of Formula in net.sf.tweety.logics.pl.syntax

Classes in net.sf.tweety.logics.pl.syntax that implement Formula

Modifier and Type	Class	Description
class	AssociativePlFormula	This class captures the common functionalities of formulas with an associative operation like conjunction, disjunction, etc.
class	Conjunction	This class represents a conjunction in propositional logic.
class	Contradiction	A contradictory formula.
class	Disjunction	This class represents a disjunction in propositional logic.
class	Equivalence	This class models equivalence of propositional logic.
class	ExclusiveDisjunction	This class represents an exclusive disjunction (XOR) in propositional logic.
class	Implication	This class models the implication of propositional logic.
class	Negation	This class models classical negation of propositional logic.
class	PlFormula	This class represents the common ancestor for propositional formulae.
class	Proposition	This class represents a simple proposition in propositional logic.
class	SpecialFormula	This class captures the common functionalities of the special formulas tautology and contradiction.
class	Tautology	A tautological formula.

Uses of Formula in net.sf.tweety.logics.qbf.syntax

Classes in net.sf.tweety.logics.qbf.syntax that implement Formula

Modifier and Type	Class	Description
class	ExistsQuantifiedFormula	This class represents existential quantification for boolean formulas.
class	ForallQuantifiedFormula	This class represents universal quantification for boolean formulas.

Uses of Formula in net.sf.tweety.logics.rcl.syntax

Classes in net.sf.tweety.logics.rcl.syntax that implement Formula

Modifier and Type	Class	Description
class	RelationalConditional	Instances of this class represent relational conditionals.

Uses of Formula in net.sf.tweety.logics.rdl.parser

Methods in net.sf.tweety.logics.rdl.parser that return Formula

Modifier and Type	Method	Description
Formula	RdlParser.parseFormula(java.io.Reader reader)

Uses of Formula in net.sf.tweety.logics.rdl.syntax

Classes in net.sf.tweety.logics.rdl.syntax that implement Formula

Modifier and Type	Class	Description
class	DefaultRule	Models a default rule in Reiter's default logic, see [R.

Uses of Formula in net.sf.tweety.logics.rpcl.syntax

Classes in net.sf.tweety.logics.rpcl.syntax that implement Formula

Modifier and Type	Class	Description
class	RelationalProbabilisticConditional	This class represents a relational probabilistic conditional, i.e.

Uses of Formula in net.sf.tweety.lp.asp.beliefdynamics.baserevision

Classes in net.sf.tweety.lp.asp.beliefdynamics.baserevision with type parameters of type Formula

Modifier and Type	Interface	Description
interface	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 net.sf.tweety.lp.asp.syntax

Classes in net.sf.tweety.lp.asp.syntax that implement Formula

Modifier and Type	Class	Description
class	AggregateAtom	This class represents an aggregate.
class	AggregateElement	This class models an aggregate element, meaning a set of terms and a set of naf literals (= literals or default negated literals).
class	ASPAtom	This class models an atom, which is a basic structure for building literals and rules for logic programs.
class	ASPBodyElement	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	ASPElement	This class acts as an abstract base class for elements of ASP rules.
class	ASPHead	This formula represents the head of an disjunctive rule which is a disjunction of literals.
class	ASPLiteral	This interface defines common functionality for literals, meaning atoms or strictly negated atoms.
class	ASPRule	This class models a rule in ASP.
class	ComparativeAtom	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	DefaultNegation	This class represents a default negated literal, i.e.
class	StrictNegation	This class models the strict negation of an atom (as apposed to a NAF negation: DefaultNegation).

Uses of Formula in net.sf.tweety.lp.nlp.syntax

Classes in net.sf.tweety.lp.nlp.syntax that implement Formula

Modifier and Type	Class	Description
class	NLPNot	A default negation of a first order formula, nested logic programs only allow not quantified formulas.
class	NLPRule	A rule of a nested logic program.