fr.lirmm.graphik.integraal.rulesetanalyser.graph.AbstractAffectedPositionSet 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
Rule base analysis for InteGraal. This is imported from Graal
The newest version!
/*
 * 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 .
 *
 * This software is governed by the CeCILL  license under French law and
 * abiding by the rules of distribution of free software.  You can  use,
 * modify and/ or redistribute the software under the terms of the CeCILL
 * license as circulated by CEA, CNRS and INRIA at the following URL
 * "http://www.cecill.info".
 *
 * As a counterpart to the access to the source code and  rights to copy,
 * modify and redistribute granted by the license, users are provided only
 * with a limited warranty  and the software's author,  the holder of the
 * economic rights,  and the successive licensors  have only  limited
 * liability.
 *
 * In this respect, the user's attention is drawn to the risks associated
 * with loading,  using,  modifying and/or developing or reproducing the
 * software by the user in light of its specific status of free software,
 * that may mean  that it is complicated to manipulate,  and  that  also
 * therefore means  that it is reserved for developers  and  experienced
 * professionals having in-depth computer knowledge. Users are therefore
 * encouraged to load and test the software's suitability as regards their
 * requirements in conditions enabling the security of their systems and/or
 * data to be ensured and,  more generally, to use and operate it in the
 * same conditions as regards security.
 *
 * The fact that you are presently reading this means that you have had
 * knowledge of the CeCILL license and that you accept its terms.
 */
package fr.lirmm.graphik.integraal.rulesetanalyser.graph;

import java.util.Set;
import java.util.TreeSet;

import fr.lirmm.graphik.integraal.api.core.Atom;
import fr.lirmm.graphik.integraal.api.core.InMemoryAtomSet;
import fr.lirmm.graphik.integraal.api.core.Predicate;
import fr.lirmm.graphik.integraal.api.core.Rule;
import fr.lirmm.graphik.integraal.api.core.Term;
import fr.lirmm.graphik.integraal.api.core.Variable;
import fr.lirmm.graphik.integraal.rulesetanalyser.util.PredicatePosition;
import fr.lirmm.graphik.util.stream.CloseableIteratorWithoutException;

/**
 * @author Clément Sipieter (INRIA) {@literal }
 *
 */
class AbstractAffectedPositionSet {

	protected Iterable ruleSet;
	protected Set affectedPosition;
	
	// /////////////////////////////////////////////////////////////////////////
	// CONSTRUCTORS
	// /////////////////////////////////////////////////////////////////////////

	public AbstractAffectedPositionSet(Iterable ruleSet) {
		this.affectedPosition = new TreeSet();
		this.ruleSet = ruleSet;
		init();
	}
	
	
	// /////////////////////////////////////////////////////////////////////////
	// GETTERS
	// /////////////////////////////////////////////////////////////////////////

	/**
	 * @return a Iterable over rules considered in this structure.
	 */
	public Iterable getRules() {
		return this.ruleSet;
	}

	// /////////////////////////////////////////////////////////////////////////
	// METHODS
	// /////////////////////////////////////////////////////////////////////////

	public boolean isAffected(Predicate predicate, int position) {
		PredicatePosition predicatePosition = new PredicatePosition(predicate, position);
		return this.isAffected(predicatePosition);
	}

	public boolean isAffected(PredicatePosition pp) {
		return this.affectedPosition.contains(pp);
	}

	public Set getAllAffectedVariables(InMemoryAtomSet body) {
		Set set = new TreeSet();
		for (Variable t : body.getVariables()) {
			set.add(t);
		}
		return this.getAllAffectedVariables(set, body);
	}

	public Set getAllAffectedFrontierVariables(Rule rule) {
		return this.getAllAffectedVariables(rule.getFrontier(), rule.getBody());
	}

	// /////////////////////////////////////////////////////////////////////////
	// Abstract METHODS
	// /////////////////////////////////////////////////////////////////////////

	protected void step2() {
		
	}
	// /////////////////////////////////////////////////////////////////////////
	// PRIVATE METHODS
	// /////////////////////////////////////////////////////////////////////////
	/**
	 * return all variable in vars that is affected
	 * 
	 * @param vars
	 * @param body
	 * @return all variable in vars that is affected.
	 */
	protected Set getAllAffectedVariables(Set vars, InMemoryAtomSet body) {
		Set affectedVars = new TreeSet();
		affectedVars.addAll(vars);
		int i;
		CloseableIteratorWithoutException it = body.iterator();
		while (it.hasNext()) {
			Atom atom = it.next();
			i = -1;
			for (Term t : atom) {
				++i;
				if (t.isVariable()
						&& !this.isAffected(atom.getPredicate(), i)) {
					affectedVars.remove(t);
				}
			}
		}
		return affectedVars;
	}

	protected void init() {
		step1();
		step2();
	}
	/**
	 * for each rule and for each existentially quantified variable occuring at
	 * position p[i] in its head, p[i] is affected;
	 */
	protected void step1() {
		int i;
		Set existentials;
		PredicatePosition predicatePosition;

		for (Rule rule : ruleSet) {
			existentials = rule.getExistentials();
			CloseableIteratorWithoutException it = rule.getHead().iterator();
			while (it.hasNext()) {
				Atom atom = it.next();
				i = -1;
				for (Term t : atom) {
					++i;
					if (existentials.contains(t)) {
						predicatePosition = new PredicatePosition(
								atom.getPredicate(), i);
						this.affectedPosition.add(predicatePosition);
					}
				}
			}
		}
	}
	
	/**
	 * @param rule
	 * @param term
	 */
	protected boolean affectInHead(Rule rule, Term term) {
		int i;
		PredicatePosition predicatePosition;
		boolean addSomeAffectedPosition = false;
		
		CloseableIteratorWithoutException it = rule.getHead().iterator();
		while (it.hasNext()) {
			Atom atom = it.next();
			i = -1;
			for (Term t : atom) {
				++i;
				if (term.equals(t)) {
					predicatePosition = new PredicatePosition(
							atom.getPredicate(), i);
					if (!isAffected(predicatePosition)) {
						this.affectedPosition.add(predicatePosition);
						addSomeAffectedPosition = true;
					}
				}
			}
		}
		return addSomeAffectedPosition;
	}
}