fr.lirmm.graphik.integraal.homomorphism.bootstrapper.StatBootstrapper 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.homomorphism.bootstrapper;

import java.util.Collection;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

import org.apache.commons.lang3.tuple.Pair;

import fr.lirmm.graphik.integraal.api.core.Atom;
import fr.lirmm.graphik.integraal.api.core.AtomSet;
import fr.lirmm.graphik.integraal.api.core.AtomSetException;
import fr.lirmm.graphik.integraal.api.core.Constant;
import fr.lirmm.graphik.integraal.api.core.RulesCompilation;
import fr.lirmm.graphik.integraal.api.core.Substitution;
import fr.lirmm.graphik.integraal.api.core.Term;
import fr.lirmm.graphik.integraal.api.store.Store;
import fr.lirmm.graphik.integraal.homomorphism.BacktrackException;
import fr.lirmm.graphik.integraal.homomorphism.VarSharedData;
import fr.lirmm.graphik.integraal.homomorphism.utils.ProbaUtils;
import fr.lirmm.graphik.util.profiler.AbstractProfilable;
import fr.lirmm.graphik.util.stream.CloseableIterator;
import fr.lirmm.graphik.util.stream.CloseableIteratorAdapter;
import fr.lirmm.graphik.util.stream.IteratorException;

/**
 * This implementation uses the atom containing v with the smallest probability of being true to
 * restrict the set of candidates.
 * 
 * @author Clément Sipieter (INRIA) {@literal }
 *
 */
public class StatBootstrapper extends AbstractProfilable implements Bootstrapper {

	private static StatBootstrapper instance;
	private static Bootstrapper fallback = StarBootstrapper.instance();

	protected StatBootstrapper() {
		super();
	}

	public static synchronized StatBootstrapper instance() {
		if (instance == null)
			instance = new StatBootstrapper();

		return instance;
	}

	// /////////////////////////////////////////////////////////////////////////
	//
	// /////////////////////////////////////////////////////////////////////////

	@Override
	public CloseableIterator exec(final VarSharedData v, Collection preAtoms, Collection postAtoms, final AtomSet data,
	    RulesCompilation rc) throws BacktrackException {
		if(!(data instanceof Store)) {
			return fallback.exec(v, preAtoms, postAtoms, data, rc);
		}
		Store store = (Store) data;
		Set terms = null;
		
		if(this.getProfiler() != null) {
			this.getProfiler().start("BootstrapTime");
			this.getProfiler().start("BootstrapTimeFirstPart");
		}
		Iterator it;

		Collection constants = null;
		Atom aa = null;
		it = postAtoms.iterator();
		while (it.hasNext()) {
			Atom a = it.next();
			if (constants == null || constants.isEmpty()) {
				constants = a.getConstants();
				aa = a;
			}
		}
		it = preAtoms.iterator();
		while (it.hasNext()) {
			Atom a = it.next();
			if (constants == null || constants.isEmpty()) {
				constants = a.getConstants();
				aa = a;
			}
		}
		try {
			if (constants != null && !constants.isEmpty()) {
				terms = new HashSet();
				for (Pair im : rc.getRewritingOf(aa)) {
					int pos = im.getLeft().indexOf(im.getRight().createImageOf(v.value));
					CloseableIterator match = data.match(im.getLeft());
					while (match.hasNext()) {
						terms.add(match.next().getTerm(pos));
					}
				}
			}

			if (this.getProfiler() != null) {
				this.getProfiler().stop("BootstrapTimeFirstPart");
			}

			if (terms == null) {
				Atom a = null, tmp;
				double probaA = 1.1;

				it = postAtoms.iterator();
				while (it.hasNext()) {
					tmp = it.next();
					double p = ProbaUtils.computeProba(tmp, store, rc);
					if (p < probaA) {
						a = tmp;
						p = probaA;
					}
				}

				it = preAtoms.iterator();
				while (it.hasNext()) {
					tmp = it.next();
					double p = ProbaUtils.computeProba(tmp, store, rc);
					if (p < probaA) {
						a = tmp;
						p = probaA;
					}
				}

				terms = BootstrapperUtils.computeCandidatesOverRewritings(a, v, data, rc);
			}

			if (this.getProfiler() != null) {
				this.getProfiler().stop("BootstrapTime");
			}

			if (terms == null) {
				return data.termsIterator();
			} else {
				return new CloseableIteratorAdapter(terms.iterator());
			}
		} catch (AtomSetException e) {
			throw new BacktrackException(e);
		} catch (IteratorException e) {
			throw new BacktrackException(e);
		}
	}

}