/* * Copyright (C) 2013-2015, 2019 by the Konclude Developer Team. * * This file is part of the reasoning system Konclude. * For details and support, see . * * Konclude is free software: you can redistribute it and/or modify * it under the terms of version 3 of the GNU Lesser General Public * License (LGPLv3) as published by the Free Software Foundation. * * Konclude is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU (Lesser) General Public License for more details. * * You should have received a copy of the GNU (Lesser) General Public * License along with Konclude. If not, see . * */ #include "CSatisfiableCalculationJobGenerator.h" namespace Konclude { namespace Reasoner { namespace Generator { CSatisfiableCalculationJobGenerator::CSatisfiableCalculationJobGenerator(CConcreteOntology *ontology) { mOntology = ontology; } CSatisfiableCalculationJobGenerator::~CSatisfiableCalculationJobGenerator() { } CSatisfiableCalculationJob* CSatisfiableCalculationJobGenerator::getSatisfiableCalculationJob(CConcept* concept, bool negation, CIndividual* individual, CSatisfiableCalculationJob* satCalcJob) { return getSatisfiableCalculationJob(concept, negation,CIndividualReference(individual),satCalcJob); } CSatisfiableCalculationJob* CSatisfiableCalculationJobGenerator::getSatisfiableCalculationJob(CConcept* concept, bool negation, const CIndividualReference& indiRef, CSatisfiableCalculationJob* satCalcJob) { return getSatisfiableCalculationJob(QList< QPair >() << QPair(concept, negation), indiRef, satCalcJob); } CSatisfiableCalculationJob* CSatisfiableCalculationJobGenerator::getSatisfiableCalculationJob(CConcept* concept1, bool negation1, CConcept* concept2, bool negation2, CIndividual* individual, CSatisfiableCalculationJob* satCalcJob) { return getSatisfiableCalculationJob(QList< QPair >()<(concept1,negation1)<(concept2,negation2),individual,satCalcJob); } CSatisfiableCalculationJob* CSatisfiableCalculationJobGenerator::getSatisfiableCalculationJob(const QList& conceptList, CIndividual* individual, CSatisfiableCalculationJob* satCalcJob) { QList< QPair > conNegList; FOREACHIT (CConcept* concept, conceptList) { conNegList.append(QPair(concept,false)); } return getSatisfiableCalculationJob(conNegList,individual,satCalcJob); } CSatisfiableCalculationJob* CSatisfiableCalculationJobGenerator::getSatisfiableCalculationJob(const QList< QPair >& conceptNegationList, CIndividual* individual, CSatisfiableCalculationJob* satCalcJob) { return getSatisfiableCalculationJob(conceptNegationList, CIndividualReference(individual), satCalcJob); } CSatisfiableCalculationJob* CSatisfiableCalculationJobGenerator::getSatisfiableCalculationJob(const QList< QPair >& conceptNegationList, const CIndividualReference& indiRef, CSatisfiableCalculationJob* satCalcJob) { if (!satCalcJob) { satCalcJob = new CSatisfiableCalculationJob(); } satCalcJob->setOntology(mOntology); CSatisfiableCalculationConceptConstruct* satCalcConstruct = new CSatisfiableCalculationConceptConstruct(); for (QList< QPair >::const_iterator it = conceptNegationList.constBegin(), itEnd = conceptNegationList.constEnd(); it != itEnd; ++it) { CConcept* concept = it->first; bool negation = it->second; CXSortedNegLinker* conNegLinker = new CXSortedNegLinker(concept,negation); satCalcConstruct->addConstructConceptLinker(conNegLinker); } if (indiRef.isNonEmpty()) { if (indiRef.getIndividual()) { satCalcConstruct->setIndividual(indiRef.getIndividual()); } else { satCalcConstruct->setIndividualID(indiRef.getIndividualID()); } } else { satCalcConstruct->setRelativeNewNodeID(satCalcJob->getNextRelativeNodeID()); } satCalcJob->addSatisfiableCalculationConstruct(satCalcConstruct); return satCalcJob; } CSatisfiableCalculationJob* CSatisfiableCalculationJobGenerator::getSatisfiableCalculationJob(const QList< CIndividual* >& indiList, CSatisfiableCalculationJob* satCalcJob) { if (!satCalcJob) { satCalcJob = new CSatisfiableCalculationJob(); } satCalcJob->setOntology(mOntology); for (QList< CIndividual* >::const_iterator it = indiList.constBegin(), itEnd = indiList.constEnd(); it != itEnd; ++it) { CIndividual* individual = (*it); CSatisfiableCalculationConceptConstruct* satCalcConstruct = new CSatisfiableCalculationConceptConstruct(); if (individual) { satCalcConstruct->setIndividual(individual); } else { satCalcConstruct->setRelativeNewNodeID(satCalcJob->getNextRelativeNodeID()); } satCalcJob->addSatisfiableCalculationConstruct(satCalcConstruct); } return satCalcJob; } CSatisfiableCalculationJob* CSatisfiableCalculationJobGenerator::getSatisfiableCalculationJob(const QList& indiList, CSatisfiableCalculationJob* satCalcJob) { if (!satCalcJob) { satCalcJob = new CSatisfiableCalculationJob(); } satCalcJob->setOntology(mOntology); for (QList::const_iterator it = indiList.constBegin(), itEnd = indiList.constEnd(); it != itEnd; ++it) { CIndividualReference individualReference = (*it); CSatisfiableCalculationConceptConstruct* satCalcConstruct = new CSatisfiableCalculationConceptConstruct(); if (individualReference.isNonEmpty()) { if (individualReference.getIndividual()) { satCalcConstruct->setIndividual(individualReference.getIndividual()); } else { satCalcConstruct->setIndividualID(individualReference.getIndividualID()); } } satCalcJob->addSatisfiableCalculationConstruct(satCalcConstruct); } return satCalcJob; } }; // end namespace Generator }; // end namespace Reasoner }; // end namespace Konclude