org.linqs.psl.groovy.syntax.FormulaContainer.groovy Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of psl-groovy Show documentation

The Groovy interface module of the PSL software from the LINQS research group.

There is a newer version: 2.2.2

/*
 * This file is part of the PSL software.
 * Copyright 2011-2015 University of Maryland
 * Copyright 2013-2019 The Regents of the University of California
 *
 * 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.
 */
package org.linqs.psl.groovy.syntax;

import org.linqs.psl.model.formula.*;
import org.linqs.psl.model.atom.Atom;

public class FormulaContainer {

    private final Formula formula;

    public FormulaContainer(Formula f) {
        formula = f;
    }

    public Formula getFormula() {
        return formula;
    }

    private void checkFormula(Object f) {
        if (!(f instanceof FormulaContainer)) throw new IllegalArgumentException("Expected formula but got : ${f}");
    }

    private void checkAtom(Object f) {
        if (!(f instanceof FormulaContainer)) throw new IllegalArgumentException("Expected formula but got : ${f}");
        if (!(f.formula instanceof Atom)) throw new IllegalArgumentException("Expected atom but got : ${f.formula}");
    }

    def and(f2) {
        checkFormula(f2);
        return new FormulaContainer(new Conjunction(formula, f2.formula));
    }

    def or(f2) {
        checkFormula(f2);
        return new FormulaContainer(new Disjunction(formula, f2.formula));
    }

    def rightShift(FormulaContainer f2) {
        then(f2);
    }

    def leftShift(f2) {
        checkFormula(f2);
        return new FormulaContainer(new Implication(f2.formula, formula));
    }

    def then(f2) {
        checkFormula(f2);
        return new FormulaContainer(new Implication(formula, f2.formula));
    }

    def bitwiseNegate() {
        return new FormulaContainer(new Negation(formula));
    }

}