001/**
002 * Copyright (C) 2007 - 2016, Jens Lehmann
003 *
004 * This file is part of DL-Learner.
005 *
006 * DL-Learner is free software; you can redistribute it and/or modify
007 * it under the terms of the GNU General Public License as published by
008 * the Free Software Foundation; either version 3 of the License, or
009 * (at your option) any later version.
010 *
011 * DL-Learner is distributed in the hope that it will be useful,
012 * but WITHOUT ANY WARRANTY; without even the implied warranty of
013 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
014 * GNU General Public License for more details.
015 *
016 * You should have received a copy of the GNU General Public License
017 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
018 */
019package org.dllearner.algorithms.qtl.operations.nbr.strategy;
020
021import java.util.List;
022
023import org.dllearner.algorithms.qtl.datastructures.impl.RDFResourceTree;
024
025/**
026 * A strategy used to apply negative-based reduction on query trees.
027 * @author Lorenz Bühmann
028 *
029 */
030public interface NBRStrategy {
031        
032        RDFResourceTree computeNBR(RDFResourceTree posExampleTree, List<RDFResourceTree> negExampleTrees);
033        
034        List<RDFResourceTree> computeNBRs(RDFResourceTree posExampleTree, List<RDFResourceTree> negExampleTrees);
035
036}