Interface BeliefSetConsistencyTester<T extends Formula>

Type Parameters:

T - The type of formulas of the belief set

All Superinterfaces:

ConsistencyTester<BeliefSet<T,?>>

All Known Subinterfaces:

MusEnumerator<S>

All Known Implementing Classes:

AbstractBeliefSetConsistencyTester, AbstractMusEnumerator, CadetSolver, CaqeSolver, CmdLineSatSolver, DimacsMaxSatSolver, DimacsSatSolver, GhostQSolver, MarcoMusEnumerator, MaxSatSolver, MimusMusEnumerator, NaiveMusEnumerator, OpenWboSolver, PclDefaultConsistencyTester, PlMusEnumerator, QbfSolver, QuteSolver, Sat4jSolver, SatSolver, SimpleDpllSolver

public interface BeliefSetConsistencyTester<T extends Formula>
extends ConsistencyTester<BeliefSet<T,?>>

Classes extending this abstract class are capable of testing whether a given belief set is consistent.

Author:

Matthias Thimm

Method Summary

Modifier and Type	Method	Description
boolean	isConsistent(Collection<T> formulas)	Checks whether the given collection of formulas is consistent.
boolean	isConsistent(BeliefSet<T,?> beliefSet)	Checks whether the given belief base is consistent.
boolean	isConsistent(T formula)	Checks whether the given formula is consistent.

Method Details

isConsistent

boolean isConsistent(BeliefSet<T,?> beliefSet)

Description copied from interface: ConsistencyTester

Checks whether the given belief base is consistent.

Specified by:

isConsistent in interface ConsistencyTester<T extends Formula>

Parameters:

beliefSet - a belief base.

Returns:

"true" iff the given belief base is consistent.

isConsistent

boolean isConsistent(Collection<T> formulas)

Checks whether the given collection of formulas is consistent.

Parameters:

formulas - a collection of formulas.

Returns:

"true" iff the given collection of formulas is consistent.

isConsistent

boolean isConsistent(T formula)

Checks whether the given formula is consistent.

Parameters:

formula - a formulas.

Returns:

"true" iff the formula is consistent.