Uses of Class
net.sf.tweety.logics.dl.syntax.ComplexConcept

Packages that use ComplexConcept

Package	Description
net.sf.tweety.logics.dl.parser
net.sf.tweety.logics.dl.semantics
net.sf.tweety.logics.dl.syntax

Uses of ComplexConcept in net.sf.tweety.logics.dl.parser

Methods in net.sf.tweety.logics.dl.parser that return ComplexConcept

Modifier and Type	Method	Description
private ComplexConcept	DlParser.parseConcept(java.lang.Object s)	Parses an atomic concept, top concept or bottom concept from a String token.
private ComplexConcept	DlParser.parseConcept(java.util.List<java.lang.Object> l)	Parses a complex concept as a list of String tokens or formulas.

Uses of ComplexConcept in net.sf.tweety.logics.dl.semantics

Methods in net.sf.tweety.logics.dl.semantics with parameters of type ComplexConcept

Modifier and Type	Method	Description
java.util.Set<Individual>	DlInterpretation.getConceptDomain(ComplexConcept c)	Returns the subset of the domain that belongs to the given concept (the extension of the concept).
boolean	DlInterpretation.isSubsumedBy(ComplexConcept c1, ComplexConcept c2)	Checks whether a concept is subsumed by another concept (c1 => c2) wrt to this interpretation

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

Subclasses of ComplexConcept in net.sf.tweety.logics.dl.syntax

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	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.

Fields in net.sf.tweety.logics.dl.syntax declared as ComplexConcept

Modifier and Type	Field	Description
private ComplexConcept	ConceptAssertion.concept	The concept or role of this assertional axiom (= the concept or role that the individuals are instances of).
private ComplexConcept	Complement.formula	The negated formula.

Fields in net.sf.tweety.logics.dl.syntax with type parameters of type ComplexConcept

Modifier and Type	Field	Description
private Pair<ComplexConcept,ComplexConcept>	EquivalenceAxiom.axiom
private Pair<ComplexConcept,ComplexConcept>	EquivalenceAxiom.axiom
private Pair<AtomicRole,ComplexConcept>	ExistentialRestriction.formulas	The role and the concept that is being restricted by it.
private Pair<AtomicRole,ComplexConcept>	UniversalRestriction.formulas	The role and the concept that is being restricted by it.
protected AssociativeFormulaSupport<ComplexConcept>	AssociativeDlFormula.support	This helper class implements most of the common functionality of an associative formula, so the implementation can delegate the method calls to the support class.

Methods in net.sf.tweety.logics.dl.syntax that return ComplexConcept

Modifier and Type	Method	Description
ComplexConcept	AtomicConcept.clone()
ComplexConcept	AtomicRole.clone()
ComplexConcept	Complement.clone()
abstract ComplexConcept	ComplexConcept.clone()	Creates a deep copy of this formula
ComplexConcept	ExistentialRestriction.clone()
ComplexConcept	Intersection.clone()
ComplexConcept	Union.clone()
ComplexConcept	UniversalRestriction.clone()
ComplexConcept	BottomConcept.collapseAssociativeFormulas()
ComplexConcept	Complement.collapseAssociativeFormulas()
abstract ComplexConcept	ComplexConcept.collapseAssociativeFormulas()	This method collapses all associative operations appearing in this term, e.g.
ComplexConcept	ExistentialRestriction.collapseAssociativeFormulas()
ComplexConcept	Intersection.collapseAssociativeFormulas()
ComplexConcept	TopConcept.collapseAssociativeFormulas()
ComplexConcept	Union.collapseAssociativeFormulas()
ComplexConcept	UniversalRestriction.collapseAssociativeFormulas()
ComplexConcept	ComplexConcept.complement()
ComplexConcept	AssociativeDlFormula.get(int index)
ComplexConcept	ConceptAssertion.getConcept()	Get the concept of this assertional axiom (= the concept that the individual is an instance of).
ComplexConcept	ExistentialRestriction.getConcept()	Get the concept of the existential restriction.
ComplexConcept	UniversalRestriction.getConcept()	Get the concept of the universal restriction.
ComplexConcept	Complement.getFormula()
ComplexConcept	AssociativeDlFormula.remove(int index)
ComplexConcept	AssociativeDlFormula.set(int index, ComplexConcept element)

Methods in net.sf.tweety.logics.dl.syntax that return types with arguments of type ComplexConcept

Modifier and Type	Method	Description
java.util.List<ComplexConcept>	AssociativeDlFormula.getFormulas()
Pair<ComplexConcept,ComplexConcept>	EquivalenceAxiom.getFormulas()
Pair<ComplexConcept,ComplexConcept>	EquivalenceAxiom.getFormulas()
Pair<AtomicRole,ComplexConcept>	ExistentialRestriction.getFormulas()	Get the role and concept that are part of the existential restriction.
Pair<AtomicRole,ComplexConcept>	UniversalRestriction.getFormulas()	Get the role and concept that are part of the universal restriction.
java.util.Iterator<ComplexConcept>	AssociativeDlFormula.iterator()
java.util.ListIterator<ComplexConcept>	AssociativeDlFormula.listIterator()
java.util.ListIterator<ComplexConcept>	AssociativeDlFormula.listIterator(int index)
java.util.List<ComplexConcept>	AssociativeDlFormula.subList(int fromIndex, int toIndex)

Methods in net.sf.tweety.logics.dl.syntax with parameters of type ComplexConcept

Modifier and Type	Method	Description
void	AssociativeDlFormula.add(int index, ComplexConcept element)
boolean	AssociativeDlFormula.add(ComplexConcept e)
ComplexConcept	AssociativeDlFormula.set(int index, ComplexConcept element)

Method parameters in net.sf.tweety.logics.dl.syntax with type arguments of type ComplexConcept

Modifier and Type	Method	Description
boolean	AssociativeDlFormula.addAll(int index, java.util.Collection<? extends ComplexConcept> c)
boolean	AssociativeDlFormula.addAll(java.util.Collection<? extends ComplexConcept> c)

Constructors in net.sf.tweety.logics.dl.syntax with parameters of type ComplexConcept

Constructor	Description
AssociativeDlFormula(ComplexConcept first, ComplexConcept second)	Creates a new associative formula with the two given formulae
Complement(ComplexConcept formula)	Create a new complement with the given DLFormula.
ConceptAssertion(Individual i, ComplexConcept c)	Initializes a role assertion with the given concept and Individual.
EquivalenceAxiom(ComplexConcept c, ComplexConcept d)	Creates a new equivalence axiom with the given formulas (atomic or complex concepts).
ExistentialRestriction(AtomicRole r, ComplexConcept c)	Creates a new ALC existential restriction with the given role and concept.
Intersection(ComplexConcept first, ComplexConcept second)	Creates a new intersection with the two given formulae
Union(ComplexConcept formula)	Create a new union with the given formula.
Union(ComplexConcept first, ComplexConcept second)	Creates a new union with the two given formulae
UniversalRestriction(AtomicRole r, ComplexConcept c)	Creates a new ALC universal restriction with the given role and concept.

Constructor parameters in net.sf.tweety.logics.dl.syntax with type arguments of type ComplexConcept

Constructor	Description
AssociativeDlFormula(java.util.Collection<? extends ComplexConcept> formulas)	Creates a new associative formula with the given inner formulas.
ExistentialRestriction(Pair<AtomicRole,ComplexConcept> f)
Intersection(java.util.Collection<? extends ComplexConcept> formulas)	Creates a new intersection with the given inner formulas.
Union(java.util.Collection<? extends ComplexConcept> formulas)	Creates a new union with the given inner formulas.