org.semanticweb.elk.owl.inferences.ElkEquivalentClassesCycle Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of elk-proofs Show documentation
Utilities to present tracing results (encoded proofs) to the user
There is a newer version: 0.36.0
package org.semanticweb.elk.owl.inferences;

/*
 * #%L
 * ELK Proofs Package
 * $Id:$
 * $HeadURL:$
 * %%
 * Copyright (C) 2011 - 2016 Department of Computer Science, University of Oxford
 * %%
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *      http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 * #L%
 */

import java.util.ArrayList;
import java.util.List;

import org.semanticweb.elk.owl.interfaces.ElkClassExpression;
import org.semanticweb.elk.owl.interfaces.ElkEquivalentClassesAxiom;
import org.semanticweb.elk.owl.interfaces.ElkObject;
import org.semanticweb.elk.owl.interfaces.ElkSubClassOfAxiom;

/**
 * Represents the inference:
 * 
 *  *    (1)           (n)     (n+1)
 *  C0 ⊑ C1 ... Cn-1 ⊑ Cn  Cn ⊑ C0
 * ⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯
 *  EquivalentClasses(C0 C1 ... Cn)
 * 
 * 
 * @author Yevgeny Kazakov
 *
 */
public class ElkEquivalentClassesCycle extends AbstractElkInference {

	public final static String NAME = "Class Inclusion Cycle";

	private final List expressions_;

	ElkEquivalentClassesCycle(List expressions) {
		this.expressions_ = expressions;
	}

	ElkEquivalentClassesCycle(ElkClassExpression first,
			ElkClassExpression second) {
		List expressions = new ArrayList(
				3);
		expressions.add(first);
		expressions.add(second);
		this.expressions_ = expressions;
	}

	public List getExpressions() {
		return expressions_;
	}

	@Override
	public String getName() {
		return NAME;
	}

	@Override
	public int getPremiseCount() {
		return expressions_.size();
	}

	@Override
	public ElkSubClassOfAxiom getPremise(int index, ElkObject.Factory factory) {
		checkPremiseIndex(index);
		int first = index, second = index + 1;
		if (second == expressions_.size()) {
			second = 0;
		}
		return factory.getSubClassOfAxiom(expressions_.get(first),
				expressions_.get(second));
	}

	@Override
	public ElkEquivalentClassesAxiom getConclusion(ElkObject.Factory factory) {
		return factory.getEquivalentClassesAxiom(expressions_);
	}

	@Override
	public  O accept(ElkInference.Visitor visitor) {
		return visitor.visit(this);
	}

	/**
	 * A factory for creating instances
	 * 
	 * @author Yevgeny Kazakov
	 *
	 */
	public interface Factory {

		ElkEquivalentClassesCycle getElkEquivalentClassesCycle(
				List expressions);

		ElkEquivalentClassesCycle getElkEquivalentClassesCycle(
				ElkClassExpression first, ElkClassExpression second);

	}

	/**
	 * The visitor pattern for instances
	 * 
	 * @author Yevgeny Kazakov
	 *
	 * @param 
	 *            the type of the output
	 */
	interface Visitor {

		O visit(ElkEquivalentClassesCycle inference);

	}

}