model

Class AndSolutionNode

java.lang.Object

model.AbstractSolutionNode

model.AndSolutionNode

public class AndSolutionNode
extends AbstractSolutionNode

This class represents a and node in the tree of proof. A solution node is a node in a tree of proof.

Author:

Alexandre Camus

Field Summary

Fields

Modifier and Type	Field and Description
private AbstractSolutionNode	headSolutionNode
private Clause	operatorTail
private AbstractSolutionNode	tailSolutionNode

Fields inherited from class model.AbstractSolutionNode

nodesCreated

Constructor Summary

Constructors

Constructor and Description
AndSolutionNode(And clause, RuleSet rules, SubstitutionSet parentSolution, AbstractSolutionNode parentNode) Constructor of the class.

Method Summary

Methods

Modifier and Type	Method and Description
protected AbstractSolutionNode	getHeadSolutionNode() Gets the solution node of the and clause's head.
protected AbstractSolutionNode	getTailSolutionNode() Gets the solution node of the and clause's tail.
SubstitutionSet	nextSolution() Creates the next solution for the and clause of the node.
protected void	reset(SubstitutionSet newParentSolution, RuleSet newRuleSet) Resets the subtree to the new state of the database and resets all the counters that prevent from infinite evaluation of the node.

Methods inherited from class model.AbstractSolutionNode

currentRuleCount, getClause, getCurrentRule, getDeepestLeaf, getParentNode, getParentSolution, getRuleSet, hasNextRule, nextRule, setDeepestLeaf

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

headSolutionNode

private AbstractSolutionNode headSolutionNode

tailSolutionNode

private AbstractSolutionNode tailSolutionNode

operatorTail

private Clause operatorTail

Constructor Detail

AndSolutionNode

public AndSolutionNode(And clause,
               RuleSet rules,
               SubstitutionSet parentSolution,
               AbstractSolutionNode parentNode)

Constructor of the class.

Parameters:

clause - the and clause to be proved by this subtree.

rules - the rules representing context of the proof.

parentSolution - the solution of the parent node in the tree of proof.

parentNode - the parent node in the tree of proof.

Method Detail

getHeadSolutionNode

protected AbstractSolutionNode getHeadSolutionNode()

Gets the solution node of the and clause's head.

This is based on the representation of an and clause. See And class for more details.

Returns:

a AbstractSolutionNode representing the solution node of the head.

getTailSolutionNode

protected AbstractSolutionNode getTailSolutionNode()

Gets the solution node of the and clause's tail.

This is based on the representation of an and clause. See And class for more details.

Returns:

a AbstractSolutionNode representing the solution node of the tail.

reset

protected void reset(SubstitutionSet newParentSolution,
         RuleSet newRuleSet)

Resets the subtree to the new state of the database and resets all the counters that prevent from infinite evaluation of the node.

Overrides:

reset in class AbstractSolutionNode

Parameters:

newParentSolution - the new parent solution of the subtree.

newRuleSet - the new state of the database.

See Also:

AbstractSolutionNode.reset(model.SubstitutionSet, model.RuleSet)

nextSolution

public SubstitutionSet nextSolution()

Creates the next solution for the and clause of the node. If no solution exists, it will create a solution. Otherwise it will get a different solution or return null if there no other different solution.

Specified by:

nextSolution in class AbstractSolutionNode

Returns:

a SubstitutionSet object representing the bindings of the next solution or null if there is no next solution.

See Also:

AbstractSolutionNode.nextSolution()