Uses of Interface
net.sf.tweety.logics.commons.syntax.interfaces.ComplexLogicalFormula

Packages that use ComplexLogicalFormula

Package	Description
net.sf.tweety.arg.aba.syntax
net.sf.tweety.arg.aspic.syntax
net.sf.tweety.arg.delp.syntax
net.sf.tweety.logics.commons.syntax
net.sf.tweety.logics.commons.syntax.interfaces
net.sf.tweety.logics.fol.syntax
net.sf.tweety.logics.ml.syntax
net.sf.tweety.logics.mln.syntax
net.sf.tweety.logics.rcl.syntax
net.sf.tweety.logics.rdl.syntax
net.sf.tweety.logics.rpcl.syntax
net.sf.tweety.lp.asp.syntax
net.sf.tweety.lp.nlp.syntax

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

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

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	InferenceRule<T extends Formula>	This class models an inference rule from an ABA theory.
class	Negation<T extends Formula>

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

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

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

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

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

Modifier and Type	Class	Description
class	DefeasibleRule	This class models a defeasible rule in defeasible logic programming.
class	DelpFact	This class implements a fact in defeasible logic programming which encapsulates a literal.
class	DelpRule	This method is the superclass for both a strict rule and a defeasible rule in defeasible logic programming and captures their common attributes and methods.
class	StrictRule	This class models a strict rule in defeasible logic programming.

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

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

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.

Methods in net.sf.tweety.logics.commons.syntax that return ComplexLogicalFormula

Modifier and Type	Method	Description
abstract ComplexLogicalFormula	ComplexLogicalFormulaAdapter.clone()
ComplexLogicalFormula	ComplexLogicalFormulaAdapter.exchange(Term<?> v, Term<?> t)
ComplexLogicalFormula	AssociativeFormulaSupport.substitute(Term<?> v, Term<?> t)
ComplexLogicalFormula	ComplexLogicalFormulaAdapter.substitute(java.util.Map<? extends Term<?>,? extends Term<?>> map)

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

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

Modifier and Type	Interface	Description
interface	QuantifiedFormula	Interface for a QuantifiedFormula with a set of quantified variables implementing an all- or exist-quantor for example.

Methods in net.sf.tweety.logics.commons.syntax.interfaces that return ComplexLogicalFormula

Modifier and Type	Method	Description
ComplexLogicalFormula	ComplexLogicalFormula.clone()
ComplexLogicalFormula	ComplexLogicalFormula.exchange(Term<?> v, Term<?> t)	Substitutes all occurrences of term "v" in this formula by term "t" and at the same time replaces all occurrences of term "t" by term "v" and eventually returns the new formula.
ComplexLogicalFormula	ComplexLogicalFormula.substitute(java.util.Map<? extends Term<?>,? extends Term<?>> map)	Substitutes all occurrences of all terms "v" in map.keyset() in this formula by map.get(v) and returns the new formula.
ComplexLogicalFormula	ComplexLogicalFormula.substitute(Term<?> v, Term<?> t)	Substitutes all occurrences of term "v" in this formula by term "t" and returns the new formula.

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

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

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 ComplexLogicalFormula in net.sf.tweety.logics.ml.syntax

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

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 ComplexLogicalFormula in net.sf.tweety.logics.mln.syntax

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

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

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

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

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

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

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

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

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

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

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

Uses of ComplexLogicalFormula in net.sf.tweety.lp.asp.syntax

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

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 ComplexLogicalFormula in net.sf.tweety.lp.nlp.syntax

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

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.