Inheritance diagram for cogitant.base.Environment:

Public Member Functions
Support	support ()
	Support. More...

Input/output.
void	loadSupport (java.io.InputStream in, IOHandler.Format format) throws ExceptionIO
	Load a support. More...

void	loadSupport (String f) throws ExceptionIO
	Load a support from a file. More...

Collection< EnvironmentObject >	loadObjects (java.io.InputStream in, IOHandler.Format format) throws ExceptionIO
	Load graphs/rules/constraints from an input stream. More...

Collection< EnvironmentObject >	loadObjects (String f) throws ExceptionIO
	Load graphs/rules/constraints from a file. More...

String	saveSupportString (IOHandler.Format format) throws ExceptionIO
	Save the support into a string. More...

String	saveObjectsString (Collection< EnvironmentObject > obj, IOHandler.Format format) throws ExceptionIO
	Save objects into a string. More...

String	saveObjectString (EnvironmentObject obj, IOHandler.Format format) throws ExceptionIO
	Save object into a string. More...

void	setIOConfig (IOHandler.ConfigPropertyBool prop, boolean val)
	Change I/O configuration. More...

Objects.
void	deleteObject (EnvironmentObject g) throws cogitant.base.Exception
	Delete an object. More...

Collection< EnvironmentObject >	objects ()
	Set of objects (graphs/rules/constraints). More...

EnvironmentObject	findObject (String name)
	Find an object by its name. More...

Graphs.
Graph	newGraph ()
	Create a new empty graph. More...

Graph	newGraph (Graph g)
	Create a new graph as a copy of a graph. More...

void	deleteGraph (Graph g) throws cogitant.base.Exception
	Delete a graph. More...

Collection< Graph >	graphs ()
	Set of graphs. More...

Graph	findGraph (String name)
	Find a graph by its name. More...

Graph	newGraphSubgraph (Graph g, GraphSubset gs) throws cogitant.base.Exception
	Create a new graph as a subset of a Graph. More...

Rules.
void	deleteRule (Rule g) throws cogitant.base.Exception
	Delete a rule. More...

Collection< Rule >	rules ()
	Set of rules. More...

Rule	findRule (String name)
	Find a rule by its name. More...

Constraints.
void	deleteConstraint (Constraint g) throws cogitant.base.Exception
	Delete a constraint. More...

Collection< Constraint >	constraints ()
	Set of constraints. More...

Constraint	findConstraint (String name)
	Find a constraint by its name. More...

Projection operations.
ProjectionConfig	projectionConfig ()
	Projection config. More...

Projection	newProjection (Graph g, Graph h) throws cogitant.base.Exception
	Creates a new (empty) projection. More...

boolean	projectionHas (Graph g, Graph h) throws cogitant.base.Exception
	Projection (existence). More...

int	projectionNum (Graph g, Graph h) throws cogitant.base.Exception
	Projection (number). More...

Collection< Projection >	projectionFind (Graph g, Graph h) throws cogitant.base.Exception
	Projection (projections). More...

void	projectionStop ()
	Stop a projection operation. More...

java.util.Iterator< Projection >	projectionIterator (Graph g, Graph h, ProjectionConfig pc) throws cogitant.base.Exception
	Creates a new Iterator<Projection> for the projections from g to h. More...

Graph operations.
void	graphDisjointSum (Graph g, Graph h) throws cogitant.base.Exception
	Disjoint sum. More...

int	graphNormalize (Graph g) throws cogitant.base.Exception
	Normalize a graph. More...

void	graphIrredundant (Graph g) throws cogitant.base.Exception
	Computes the irredundant form of a graph. More...

void	graphExternalJoin (Graph g1, GraphObject cg1, Graph g2, GraphObject cg2) throws cogitant.base.Exception
	External join. More...

void	graphExternalJoin (Graph g1, Graph g2, GraphSubset subsetg2, Collection< GraphObject > nodesg1, Collection< GraphObject > nodesg2) throws cogitant.base.Exception
	External joins. More...

Graph checkings.
boolean	graphVerifyIrredundant (Graph g) throws cogitant.base.Exception
	Irredundant graph. More...

boolean	graphVerifyEdges (Graph g) throws cogitant.base.Exception
	Well-formed graph. More...

void	graphEnsureWellFormed (Graph g) throws cogitant.base.Exception
	Verifies if a graph is well-formed. More...

Rule operations.
Collection< Projection >	ruleApplications (Graph g, Rule r, boolean newkonly) throws cogitant.base.Exception
	Projections from the hypothesis of the rule on the graph. More...

boolean	ruleApply (Graph g, Rule r, Projection p, boolean newkonly) throws cogitant.base.Exception
	Apply a rule on a graph given a projection of the hypothesis. More...

int	rulesClosure (Graph g, Collection< Rule > r, int maxapp, int maxpasses) throws cogitant.base.Exception
	Closure of a graph. More...

int	rulesClosureNormalize (Graph g, Collection< Rule > r, int maxapp, int maxpasses) throws cogitant.base.Exception
	Closure of a graph + Normalize. More...

Constraint operations.
boolean	constraintSatisfaction (Graph g, Constraint c) throws cogitant.base.Exception
	Satisfaction of a constraint by a graph. More...

CoupleOfProjections	constraintSatisfactionViolation (Graph g, Constraint c) throws cogitant.base.Exception
	Satisfaction of a constraint by a graph. More...

Individual graph operations.
void	individualGraphsClosure (Graph g, Collection< Graph > indg) throws cogitant.base.Exception
	Closure of a graph by a set of individual graphs. More...

Detailed Description

Environment.

Member Function Documentation

◆ constraints()

Collection<Constraint> cogitant.base.Environment.constraints ( )

Set of constraints.

Implemented in cogitant.jni.Environment.

◆ constraintSatisfaction()

boolean cogitant.base.Environment.constraintSatisfaction	(	Graph	g,
		Constraint	c
	)		throws cogitant.base.Exception

Satisfaction of a constraint by a graph.

Parameters

g	a graph of the Environment.
c	a constraint of the Environment.

Returns: true iff g satisfies c.

◆ constraintSatisfactionViolation()

CoupleOfProjections cogitant.base.Environment.constraintSatisfactionViolation	(	Graph	g,
		Constraint	c
	)		throws cogitant.base.Exception

Satisfaction of a constraint by a graph.

Parameters

g	a graph of the Environment.
c	a constraint of the Environment.

Returns

if g satisfies c, returns null. Otherwise:

if c is a positive constraint: the first element of the couple of projections contains a projection from the condition of c on g that cannot be extended on a projection of the obligation of c on g.
if c is a negative constraint: the first element of the couple of projecitons contains a projection from the condition of c on g such that there exists a projection from the interdiction of c on g. This projection is returned on the second element of the couple.

◆ deleteConstraint()

void cogitant.base.Environment.deleteConstraint ( Constraint g ) throws cogitant.base.Exception

Delete a constraint.

◆ deleteGraph()

void cogitant.base.Environment.deleteGraph ( Graph g ) throws cogitant.base.Exception

Delete a graph.

◆ deleteObject()

void cogitant.base.Environment.deleteObject ( EnvironmentObject g ) throws cogitant.base.Exception

Delete an object.

◆ deleteRule()

void cogitant.base.Environment.deleteRule ( Rule g ) throws cogitant.base.Exception

Delete a rule.

◆ findConstraint()

Constraint cogitant.base.Environment.findConstraint ( String name )

Find a constraint by its name.

Parameters

name	searched name.

Returns: constraint having this name or null.

See also: findObject().

Implemented in cogitant.jni.Environment.

◆ findGraph()

Graph cogitant.base.Environment.findGraph ( String name )

Find a graph by its name.

Parameters

name	searched name.

Returns: graph having this name or null.

See also: findObject().

Implemented in cogitant.jni.Environment.

◆ findObject()

EnvironmentObject cogitant.base.Environment.findObject ( String name )

Find an object by its name.

Parameters

name	searched name.

Returns: object having this name or null.

See also: EnvironmentObject.name().

Implemented in cogitant.jni.Environment.

◆ findRule()

Rule cogitant.base.Environment.findRule ( String name )

Find a rule by its name.

Parameters

name	searched name.

Returns: rule having this name or null.

See also: findObject().

Implemented in cogitant.jni.Environment.

◆ graphDisjointSum()

void cogitant.base.Environment.graphDisjointSum	(	Graph	g,
		Graph	h
	)		throws cogitant.base.Exception

Disjoint sum.

Parameters

g	a graph of the Environment. This graph is modified and contains the disjoint sum g + h when this method finishes.
h	a graph of the Environment.

◆ graphEnsureWellFormed()

void cogitant.base.Environment.graphEnsureWellFormed ( Graph g ) throws cogitant.base.Exception

Verifies if a graph is well-formed.

Throws an if the graph is not well-formed.

Parameters

g	a graph of the Environment.

◆ graphExternalJoin() [1/2]

void cogitant.base.Environment.graphExternalJoin	(	Graph	g1,
		GraphObject	cg1,
		Graph	g2,
		GraphObject	cg2
	)		throws cogitant.base.Exception

External join.

Parameters

g1	graph of the Environment. This graph is modified.
cg1	concept node of g1.
g2	graph of the Environment.
cg2	concept node of g2.

◆ graphExternalJoin() [2/2]

void cogitant.base.Environment.graphExternalJoin	(	Graph	g1,
		Graph	g2,
		GraphSubset	subsetg2,
		Collection< GraphObject >	nodesg1,
		Collection< GraphObject >	nodesg2
	)		throws cogitant.base.Exception

External joins.

Parameters

g1	graph of the Environment. This graph is modified.
g2	graph of the Environment.
subsetg2	subset of g2 that contains nodes of g2 to copy into g1.
nodesg1	concept nodes of g1.
nodesg2	concept nodes of g2 that are joined with nodes of g1. The i-th node of nodesg2 is joind with the i-th node of nodesg1.

◆ graphIrredundant()

void cogitant.base.Environment.graphIrredundant ( Graph g ) throws cogitant.base.Exception

Computes the irredundant form of a graph.

Parameters

g	graph of the Environment. This graph is modified.

◆ graphNormalize()

int cogitant.base.Environment.graphNormalize ( Graph g ) throws cogitant.base.Exception

Normalize a graph.

Parameters

g	a graph of the Environment. This graph is modified.

Returns: number of merges.

◆ graphs()

Collection<Graph> cogitant.base.Environment.graphs ( )

Set of graphs.

Implemented in cogitant.jni.Environment.

◆ graphVerifyEdges()

boolean cogitant.base.Environment.graphVerifyEdges ( Graph g ) throws cogitant.base.Exception

Well-formed graph.

Parameters

g	a graph of the Environment.

Returns: true iff a does not contain pending edges.

◆ graphVerifyIrredundant()

boolean cogitant.base.Environment.graphVerifyIrredundant ( Graph g ) throws cogitant.base.Exception

Irredundant graph.

Parameters

g	a graph of the Environment.

Returns: true iff a is irredundant.

◆ individualGraphsClosure()

void cogitant.base.Environment.individualGraphsClosure	(	Graph	g,
		Collection< Graph >	indg
	)		throws cogitant.base.Exception

Closure of a graph by a set of individual graphs.

Note that individual graphs are used to expand concept nodes of the initial graph only. Added nodes are not expanded.

Parameters

g	a graph of the Environment. This graph is modified by the method and contains the closure of the initial graph with th set of individual graphs.
indg	set of individual graphs.

◆ loadObjects() [1/2]

Collection<EnvironmentObject> cogitant.base.Environment.loadObjects	(	java.io.InputStream	in,
		IOHandler.Format	format
	)		throws ExceptionIO

Load graphs/rules/constraints from an input stream.

Parameters

in	input stream.
format	input format.

Returns: collection of loaded objects.

◆ loadObjects() [2/2]

Collection<EnvironmentObject> cogitant.base.Environment.loadObjects ( String f ) throws ExceptionIO

Load graphs/rules/constraints from a file.

Parameters

f filename.

Implemented in cogitant.jni.Environment.

◆ loadSupport() [1/2]

void cogitant.base.Environment.loadSupport	(	java.io.InputStream	in,
		IOHandler.Format	format
	)		throws ExceptionIO

Load a support.

This method replaces the current support.

Parameters

in	input stream.
format	input format.

◆ loadSupport() [2/2]

void cogitant.base.Environment.loadSupport ( String f ) throws ExceptionIO

Load a support from a file.

This method replaces the current support.

Parameters

f filename.

Implemented in cogitant.jni.Environment.

◆ newGraph() [1/2]

Graph cogitant.base.Environment.newGraph ( )

Create a new empty graph.

Implemented in cogitant.jni.Environment.

◆ newGraph() [2/2]

Graph cogitant.base.Environment.newGraph ( Graph g )

Create a new graph as a copy of a graph.

◆ newGraphSubgraph()

Graph cogitant.base.Environment.newGraphSubgraph	(	Graph	g,
		GraphSubset	gs
	)		throws cogitant.base.Exception

Create a new graph as a subset of a Graph.

◆ newProjection()

Projection cogitant.base.Environment.newProjection	(	Graph	g,
		Graph	h
	)		throws cogitant.base.Exception

Creates a new (empty) projection.

◆ objects()

Collection<EnvironmentObject> cogitant.base.Environment.objects ( )

Set of objects (graphs/rules/constraints).

Implemented in cogitant.jni.Environment.

◆ projectionConfig()

ProjectionConfig cogitant.base.Environment.projectionConfig ( )

Projection config.

Implemented in cogitant.jni.Environment.

◆ projectionFind()

Collection<Projection> cogitant.base.Environment.projectionFind	(	Graph	g,
		Graph	h
	)		throws cogitant.base.Exception

Projection (projections).

Parameters

g	a graph of the Environment.
h	a normal graph of the Environment.

Returns: projections from g into h.

◆ projectionHas()

boolean cogitant.base.Environment.projectionHas	(	Graph	g,
		Graph	h
	)		throws cogitant.base.Exception

Projection (existence).

Parameters

g	a graph of the Environment.
h	a normal graph of the Environment.

Returns: true if there is a projection from g into h, otherwise 0.

◆ projectionIterator()

java.util.Iterator<Projection> cogitant.base.Environment.projectionIterator	(	Graph	g,
		Graph	h,
		ProjectionConfig	pc
	)		throws cogitant.base.Exception

Creates a new Iterator<Projection> for the projections from g to h.

Parameters

g	a graph of the Environment.
h	a norma graph of the Environment.
pc	projection config. If null, uses the default ProjectionConfig from the Environment.

Returns: projections form g to h.

Warning: Once this method has been called, modifying g or h is strictly forbidden.

◆ projectionNum()

int cogitant.base.Environment.projectionNum	(	Graph	g,
		Graph	h
	)		throws cogitant.base.Exception

Projection (number).

Parameters

g	a graph of the Environment.
h	a normal graph of the Environment.

Returns: number of projections from g into h.

◆ projectionStop()

void cogitant.base.Environment.projectionStop ( )

Stop a projection operation.

When called from another thread, this method ask the projection operation (called by projectionHas(), projectionNum() or projectionFind()) to stop as soon as possible.

Implemented in cogitant.jni.Environment.

◆ ruleApplications()

Collection<Projection> cogitant.base.Environment.ruleApplications	(	Graph	g,
		Rule	r,
		boolean	newkonly
	)		throws cogitant.base.Exception

Projections from the hypothesis of the rule on the graph.

Parameters

g	a graph of the Environment.
r	a rule of the Environement.
newkonly	if `true` returns only projections that may produce new knowledge, if `false` returns each projection from thy hypothesis of r to g.

Returns: projections from the hypothesis of r to g.

◆ ruleApply()

boolean cogitant.base.Environment.ruleApply	(	Graph	g,
		Rule	r,
		Projection	p,
		boolean	newkonly
	)		throws cogitant.base.Exception

Apply a rule on a graph given a projection of the hypothesis.

Parameters

g	a graph of the Environment. This graph is modified by the method.
r	a rule of the Environement.
p	a projection of the hypothesis of r on g.
newkonly	if `true` apply r only if this application adds new knowledge to g. If `false`, always apply the rule.

Returns: true iff the rule has been applied.

◆ rules()

Collection<Rule> cogitant.base.Environment.rules ( )

Set of rules.

Implemented in cogitant.jni.Environment.

◆ rulesClosure()

int cogitant.base.Environment.rulesClosure	(	Graph	g,
		Collection< Rule >	r,
		int	maxapp,
		int	maxpasses
	)		throws cogitant.base.Exception

Closure of a graph.

Parameters

g	a graph of the Environment. This graph is modified and contains the closure of the initial graph with the set of rules.
r	a set of rules. If `null` every rule of the Environment is taken into account.
maxapp	maximal number of rule applications (0: unlimited).
maxpasses	maximal number of passes. (0: unlimited).

Returns: number of rule applications.

◆ rulesClosureNormalize()

int cogitant.base.Environment.rulesClosureNormalize	(	Graph	g,
		Collection< Rule >	r,
		int	maxapp,
		int	maxpasses
	)		throws cogitant.base.Exception

Closure of a graph + Normalize.

Normalizes g after each application of a rule.

Parameters

g	a graph of the Environment. This graph is modified and contains the closure of the initial graph with the set of rules.
r	a set of rules. If `null` every rule of the Environment is taken into account.
maxapp	maximal number of rule applications (0: unlimited).
maxpasses	maximal number of passes. (0: unlimited).

Returns: number of rule applications.

◆ saveObjectsString()

String cogitant.base.Environment.saveObjectsString	(	Collection< EnvironmentObject >	obj,
		IOHandler.Format	format
	)		throws ExceptionIO

Save objects into a string.

Parameters

obj	objects.
format	output format.

Returns: a string containing a serialization of the objects in the given format.

◆ saveObjectString()

String cogitant.base.Environment.saveObjectString	(	EnvironmentObject	obj,
		IOHandler.Format	format
	)		throws ExceptionIO

Save object into a string.

Parameters

obj	object.
format	output format.

Returns: a string containing a serialization of the object in the given format.

◆ saveSupportString()

String cogitant.base.Environment.saveSupportString ( IOHandler.Format format ) throws ExceptionIO

Save the support into a string.

Parameters

format output format.

Returns: a string containing a serialization of the support in the given format.

◆ setIOConfig()

void cogitant.base.Environment.setIOConfig	(	IOHandler.ConfigPropertyBool	prop,
		boolean	val
	)

Change I/O configuration.

Parameters

prop	property.
val	value.

Implemented in cogitant.jni.Environment.

◆ support()

Support cogitant.base.Environment.support ( )

Support.

Implemented in cogitant.jni.Environment.

Public Member Functions

Detailed Description

Member Function Documentation

◆ constraints()

◆ constraintSatisfaction()

◆ constraintSatisfactionViolation()

◆ deleteConstraint()

◆ deleteGraph()

◆ deleteObject()

◆ deleteRule()

◆ findConstraint()

◆ findGraph()

◆ findObject()

◆ findRule()

◆ graphDisjointSum()

◆ graphEnsureWellFormed()

◆ graphExternalJoin() [1/2]

◆ graphExternalJoin() [2/2]

◆ graphIrredundant()

◆ graphNormalize()

◆ graphs()

◆ graphVerifyEdges()

◆ graphVerifyIrredundant()

◆ individualGraphsClosure()

◆ loadObjects() [1/2]

◆ loadObjects() [2/2]

◆ loadSupport() [1/2]

◆ loadSupport() [2/2]

◆ newGraph() [1/2]

◆ newGraph() [2/2]

◆ newGraphSubgraph()

◆ newProjection()

◆ objects()

◆ projectionConfig()

◆ projectionFind()

◆ projectionHas()

◆ projectionIterator()

◆ projectionNum()

◆ projectionStop()

◆ ruleApplications()

◆ ruleApply()

◆ rules()

◆ rulesClosure()

◆ rulesClosureNormalize()

◆ saveObjectsString()

◆ saveObjectString()

◆ saveSupportString()

◆ setIOConfig()

◆ support()