fr.lirmm.graphik.integraal.rulesetanalyser.graph.GraphPositionDependencies Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of integraal-graal-ruleset-analysis Show documentation
Show all versions of integraal-graal-ruleset-analysis Show documentation
Rule base analysis for InteGraal. This is imported from Graal
/*
* Copyright (C) Inria Sophia Antipolis - Méditerranée / LIRMM
* (Université de Montpellier & CNRS) (2014 - 2017)
*
* Contributors :
*
* Clément SIPIETER
* Mélanie KÖNIG
* Swan ROCHER
* Jean-François BAGET
* Michel LECLÈRE
* Marie-Laure MUGNIER
*
*
* This file is part of Graal }
* @author Swan Rocher
*
*/
public class GraphPositionDependencies {
public static class SpecialEdge extends DefaultEdge {
private static final long serialVersionUID = 3660050932528046714L;
}
private Set isFiniteRank = null;
private Graph graph = new DefaultDirectedGraph(DefaultEdge.class);
private Iterable rules;
public GraphPositionDependencies(Iterable rules) {
this.rules = rules;
init();
}
public Set edgeSet() {
return this.graph.edgeSet();
}
public PredicatePosition getEdgeTarget(DefaultEdge e) {
return this.graph.getEdgeTarget(e);
}
public PredicatePosition getEdgeSource(DefaultEdge e) {
return this.graph.getEdgeSource(e);
}
public boolean isWeaklyAcyclic() {
for (DefaultEdge e : this.graph.edgeSet()) {
if (e instanceof SpecialEdge) {
PredicatePosition head = this.graph.getEdgeTarget(e);
PredicatePosition tail = this.graph.getEdgeSource(e);
Set markedVertex = new TreeSet();
markedVertex.add(head);
markedVertex.add(tail);
if (this.findSpecialCycle(head, markedVertex, tail)) {
return false;
}
}
}
return true;
}
public boolean isFiniteRank(Predicate p, int position) {
return isFiniteRank(new PredicatePosition(p, position));
}
public void initFiniteRank() {
if (this.isFiniteRank == null) {
this.isFiniteRank = new TreeSet();
StrongConnectivityAlgorithm sccInspector = new GabowStrongConnectivityInspector(
graph);
List> sccList = sccInspector
.stronglyConnectedSets();
for (Set scc : sccList) {
boolean componentIsFiniteRank = true;
for (PredicatePosition p1 : scc) {
for (PredicatePosition p2 : scc) {
for (DefaultEdge edge : graph.getAllEdges(p1, p2)) {
if (edge instanceof SpecialEdge) {
componentIsFiniteRank = false;
}
}
}
}
// store information
if (componentIsFiniteRank) {
for (PredicatePosition p : scc) {
this.isFiniteRank.add(p);
}
}
}
}
}
public boolean isFiniteRank(PredicatePosition p) {
initFiniteRank();
return this.isFiniteRank.contains(p);
}
/**
* @param vertex
* @param markedVertex
* @return true if there is a specialCycle, false otherwise.
*/
private boolean findSpecialCycle(PredicatePosition vertex, Set markedVertex,
PredicatePosition vertexCible) {
for (DefaultEdge edge : this.graph.outgoingEdgesOf(vertex)) {
PredicatePosition v = this.graph.getEdgeTarget(edge);
if (v.equals(vertexCible)) {
return true;
} else if (!markedVertex.contains(v)) {
markedVertex.add(v);
if (this.findSpecialCycle(v, markedVertex, vertexCible)) {
return true;
}
}
}
return false;
}
private void init() {
int bodyTermIndex, headTermIndex;
Set existentials;
for (Rule r : this.rules) {
existentials = r.getExistentials();
CloseableIteratorWithoutException bodyIt = r.getBody().iterator();
while (bodyIt.hasNext()) {
Atom bodyAtom = bodyIt.next();
bodyTermIndex = -1;
for (Term bodyTerm : bodyAtom) {
++bodyTermIndex;
if (r.getHead().getTerms().contains(bodyTerm)) {
CloseableIteratorWithoutException headIt = r.getHead().iterator();
while (headIt.hasNext()) {
Atom headAtom = headIt.next();
headTermIndex = -1;
for (Term headTerm : headAtom) {
++headTermIndex;
if (bodyTerm.equals(headTerm)) {
this.addEdge(
new PredicatePosition(bodyAtom.getPredicate(), bodyTermIndex),
new PredicatePosition(headAtom.getPredicate(), headTermIndex));
} else if (existentials.contains(headTerm)) {
this.addSpecialEdge(
new PredicatePosition(bodyAtom.getPredicate(), bodyTermIndex),
new PredicatePosition(headAtom.getPredicate(), headTermIndex));
}
}
}
} else {
if (!this.graph.containsVertex(new PredicatePosition(bodyAtom.getPredicate(), bodyTermIndex))) {
this.graph.addVertex(new PredicatePosition(bodyAtom.getPredicate(), bodyTermIndex));
}
}
}
}
}
}
/**
* @param predicatePosition
* @param predicatePosition2
*/
private void addSpecialEdge(PredicatePosition predicatePosition,
PredicatePosition predicatePosition2) {
if(this.graph.containsEdge(predicatePosition, predicatePosition2)) {
this.graph.removeEdge(predicatePosition, predicatePosition2);
} else {
if(!this.graph.containsVertex(predicatePosition)) {
this.graph.addVertex(predicatePosition);
}
if(!this.graph.containsVertex(predicatePosition2)) {
this.graph.addVertex(predicatePosition2);
}
}
this.graph.addEdge(predicatePosition, predicatePosition2, new SpecialEdge());
}
/**
* @param predicatePosition
* @param predicatePosition2
*/
private void addEdge(PredicatePosition predicatePosition,
PredicatePosition predicatePosition2) {
if(!this.graph.containsEdge(predicatePosition, predicatePosition2)) {
if(!this.graph.containsVertex(predicatePosition)) {
this.graph.addVertex(predicatePosition);
}
if(!this.graph.containsVertex(predicatePosition2)) {
this.graph.addVertex(predicatePosition2);
}
this.graph.addEdge(predicatePosition, predicatePosition2);
}
}
}