• Home
• fr.lirmm.graphik
• integraal-graal-ruleset-analysis
• 1.6.1
• source code
• BasicChase.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

fr.lirmm.graphik.integraal.forward_chaining.BasicChase Maven / Gradle / Ivy

/*
 * 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.forward_chaining;

import java.util.Iterator;

import fr.lirmm.graphik.integraal.api.core.AtomSet;
import fr.lirmm.graphik.integraal.api.core.Query;
import fr.lirmm.graphik.integraal.api.core.Rule;
import fr.lirmm.graphik.integraal.api.core.RuleSet;
import fr.lirmm.graphik.integraal.api.core.RulesCompilation;
import fr.lirmm.graphik.integraal.api.forward_chaining.AbstractDirectChase;
import fr.lirmm.graphik.integraal.api.forward_chaining.ChaseException;
import fr.lirmm.graphik.integraal.api.forward_chaining.ChaseHaltingCondition;
import fr.lirmm.graphik.integraal.api.forward_chaining.DirectRuleApplier;
import fr.lirmm.graphik.integraal.api.homomorphism.Homomorphism;
import fr.lirmm.graphik.integraal.api.homomorphism.HomomorphismWithCompilation;
import fr.lirmm.graphik.integraal.core.ruleset.LinkedListRuleSet;
import fr.lirmm.graphik.integraal.forward_chaining.rule_applier.DefaultRuleApplier;
import fr.lirmm.graphik.integraal.forward_chaining.rule_applier.DefaultRuleApplierWithCompilation;

/**
 * This chase (forward-chaining) algorithm iterates over all rules at each step.
 * It stops if a step does not produce new facts.
 * 
 * @author Clément Sipieter (INRIA) 
 *
 */
public class BasicChase extends AbstractDirectChase {

	private RuleSet ruleSet;
	private T atomSet;
	private boolean hasNext = true;

	// /////////////////////////////////////////////////////////////////////////
	// CONSTRUCTORS
	// /////////////////////////////////////////////////////////////////////////

	public BasicChase(Iterator rules, T atomSet) {
		super(new DefaultRuleApplier());
		this.atomSet = atomSet;
		this.ruleSet = new LinkedListRuleSet(rules);
	}

	public BasicChase(Iterable rules, T atomSet) {
		super(new DefaultRuleApplier());
		this.atomSet = atomSet;
		this.ruleSet = new LinkedListRuleSet(rules);
	}

	public BasicChase(Iterator rules, T atomSet, DirectRuleApplier ruleApplier) {
		super(ruleApplier);
		this.atomSet = atomSet;
		this.ruleSet = new LinkedListRuleSet(rules);
	}

	public BasicChase(Iterable rules, T atomSet, DirectRuleApplier ruleApplier) {
		this(rules.iterator(), atomSet, ruleApplier);
	}

	public BasicChase(Iterable rules, T atomSet, Homomorphism solver) {
		this(rules, atomSet, new DefaultRuleApplier(solver));
	}

	public BasicChase(Iterable rules, T atomSet, ChaseHaltingCondition haltingCondition) {
		this(rules, atomSet, new DefaultRuleApplier(haltingCondition));

	}

	public BasicChase(Iterable rules, T atomSet, Homomorphism solver,
	    ChaseHaltingCondition haltingCondition) {
		this(rules, atomSet, new DefaultRuleApplier(solver, haltingCondition));
	}
	
	public BasicChase(Iterable rules, T atomSet, RulesCompilation compilation) {
		this(rules, atomSet, new DefaultRuleApplierWithCompilation(compilation));
	}
	
	public BasicChase(Iterator rules, T atomSet, RulesCompilation compilation) {
		this(rules, atomSet, new DefaultRuleApplierWithCompilation(compilation));
	}

	public BasicChase(Iterable rules, T atomSet, RulesCompilation compilation,
			HomomorphismWithCompilation h) {
		this(rules, atomSet, new DefaultRuleApplierWithCompilation(h, compilation));
	}

	// /////////////////////////////////////////////////////////////////////////
	// PUBLICS METHODS
	// /////////////////////////////////////////////////////////////////////////

	@Override
	public void next() throws ChaseException {
		try {
			this.hasNext = false;
			for (Rule rule : this.ruleSet) {
				String key = null;
				if (this.getProfiler().isProfilingEnabled()) {
					this.getProfiler().start("saturationTime");
					this.getProfiler().trace(rule.toString());
					key = "Rule " + rule.getLabel() + " application time";
					this.getProfiler().clear(key);
					this.getProfiler().start(key);
				}

				boolean val = this.getRuleApplier().apply(rule, this.atomSet);
				this.hasNext = this.hasNext || val;

				if (this.getProfiler().isProfilingEnabled()) {
					this.getProfiler().stop(key);
					this.getProfiler().stop("saturationTime");
				}
			}
		} catch (Exception e) {
			throw new ChaseException("An error occured during saturation step.", e);
		}
	}

	@Override
	public boolean hasNext() {
		return this.hasNext;
	}

}