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

Packages that use ClassicalFormula

Package	Description
net.sf.tweety.action.query.syntax
net.sf.tweety.arg.delp.syntax
net.sf.tweety.arg.dung.ldo.syntax
net.sf.tweety.beliefdynamics
net.sf.tweety.logics.commons.syntax
net.sf.tweety.logics.dl.syntax
net.sf.tweety.logics.fol.syntax
net.sf.tweety.logics.ml.syntax
net.sf.tweety.logics.mln.syntax
net.sf.tweety.logics.pl.syntax
net.sf.tweety.logics.qbf.syntax
net.sf.tweety.logics.rcl.syntax
net.sf.tweety.logics.rdl.syntax
net.sf.tweety.logics.rpcl.syntax
net.sf.tweety.lp.nlp.syntax

Uses of ClassicalFormula in net.sf.tweety.action.query.syntax

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

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.

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

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

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 ClassicalFormula in net.sf.tweety.arg.dung.ldo.syntax

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

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.

Methods in net.sf.tweety.arg.dung.ldo.syntax that return ClassicalFormula

Modifier and Type	Method	Description
ClassicalFormula	LdoFormula.complement()

Uses of ClassicalFormula in net.sf.tweety.beliefdynamics

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

Modifier and Type	Class	Description
class	LeviBaseRevisionOperator<T extends ClassicalFormula>	This class implements the Levi identity for revision, ie.
class	LeviMultipleBaseRevisionOperator<T extends ClassicalFormula>	This class implements the Levi identity for multiple revision, ie.

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

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

Modifier and Type	Class	Description
class	RelationalFormula	This is the abstract base class for relational formulas, i.e.

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

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

Modifier and Type	Class	Description
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	ExistentialRestriction	This class models an existential restriction in description logics, i.e.
class	Intersection	This class models an intersection in description logics.
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 ClassicalFormula in net.sf.tweety.logics.fol.syntax

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

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

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

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

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

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

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

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

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.

Methods in net.sf.tweety.logics.pl.syntax that return ClassicalFormula

Modifier and Type	Method	Description
ClassicalFormula	PlFormula.complement()

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

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

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 ClassicalFormula in net.sf.tweety.logics.rcl.syntax

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

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

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

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

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

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

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

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

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

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

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