Package tools.refinery.logic.literal

Interface Literal

All Known Subinterfaces:

CanNegate<T>, TermLiteral<T>

All Known Implementing Classes:

AbstractCallLiteral, AbstractCountLiteral, AbstractLiteral, AssignLiteral, BooleanLiteral, CallLiteral, CheckLiteral, ConstantLiteral, EquivalenceLiteral, RepresentativeElectionLiteral

public interface Literal

In mathematical logic, a literal is an atomic formula or its negation. A literal is a formula that is either true or false, but not both. It is a basic building block of logic.

A clause is a propositional (well-formed) formula formed from a finite collection of literals and logical connectives.

Method Summary

Modifier and Type	Method	Description
boolean	equalsWithSubstitution(LiteralEqualityHelper helper, Literal other)
Set<Variable>	getInputVariables(Set<? extends Variable> positiveVariablesInClause)
Set<Variable>	getOutputVariables()
Set<Variable>	getPrivateVariables(Set<? extends Variable> positiveVariablesInClause)
int	hashCodeWithSubstitution(LiteralHashCodeHelper helper)
default Literal	reduce()
Literal	substitute(Substitution substitution)

Method Details

getOutputVariables

Set<Variable> getOutputVariables()

getInputVariables

Set<Variable> getInputVariables(Set<? extends Variable> positiveVariablesInClause)

getPrivateVariables

Set<Variable> getPrivateVariables(Set<? extends Variable> positiveVariablesInClause)

substitute

Literal substitute(Substitution substitution)

reduce

default Literal reduce()

equalsWithSubstitution

boolean equalsWithSubstitution(LiteralEqualityHelper helper,
 Literal other)

hashCodeWithSubstitution

int hashCodeWithSubstitution(LiteralHashCodeHelper helper)