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.QueryTreeUtils;
024import org.dllearner.algorithms.qtl.datastructures.impl.RDFResourceTree;
025
026/**
027 * 
028 * @author Lorenz Bühmann
029 *
030 */
031public class TagNonSubsumingPartsNBRStrategy implements NBRStrategy{
032
033        @Override
034        public RDFResourceTree computeNBR(RDFResourceTree posExampleTree,
035                        List<RDFResourceTree> negExampleTrees) {
036                
037                for(RDFResourceTree negExampleTree : negExampleTrees){
038                        QueryTreeUtils.isSubsumedBy(negExampleTree, posExampleTree);
039                }
040                
041                RDFResourceTree nbr = buildNBR(posExampleTree);
042                
043                return nbr;
044        }
045
046        @Override
047        public List<RDFResourceTree> computeNBRs(RDFResourceTree posExampleTree,
048                        List<RDFResourceTree> negExampleTrees) {
049                // TODO Auto-generated method stub
050                return null;
051        }
052        
053        private RDFResourceTree buildNBR(RDFResourceTree tree){
054                RDFResourceTree nbr = new RDFResourceTree(tree.getData());
055                
056                for(RDFResourceTree child : tree.getChildren()){
057//                      if(child.isTagged()){
058//                              nbr.addChild(buildNBR(child), tree.getEdgeToChild(child));
059//                      }
060                        //TODO refactor
061                }
062                
063                return nbr;
064        }
065
066}