Package | Description |
---|---|
net.sf.tweety.action | |
net.sf.tweety.action.description | |
net.sf.tweety.logics.commons.analysis | |
net.sf.tweety.logics.pcl.analysis | |
net.sf.tweety.logics.pl.sat |
Modifier and Type | Interface and Description |
---|---|
interface |
ActionDescriptionConsistencyTester<T extends CausalLaw>
Classes implementing this interface are capable of checking whether a given
action description is consistent according to some consistency measurements.
|
Modifier and Type | Class and Description |
---|---|
class |
CActionDescriptionConsistencyTester
This class is able to check, whether a given action description in the action
language C is consistent with regards to one simple consistency requirement:
The transition system described by the action description has at least one
state.
|
Modifier and Type | Interface and Description |
---|---|
interface |
BeliefSetConsistencyTester<S extends Formula>
Classes extending this abstract class are capable of testing
whether a given belief set is consistent.
|
interface |
MusEnumerator<S extends Formula>
Interface for classes enumerating MUSes (minimal unsatisfiable sets) and
MCSs (maximal consistent sets).
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractBeliefSetConsistencyTester<S extends Formula>
Classes extending this abstract class are capable of testing
whether a given belief set is consistent.
|
class |
AbstractMusEnumerator<S extends Formula>
Abstract implementation for MUes enumerators.
|
class |
NaiveMusEnumerator<S extends Formula>
A simple approach to compute minimal inconsistent subsets and maximal
consistent subsets by exhaustive search.
|
Modifier and Type | Class and Description |
---|---|
class |
PclDefaultConsistencyTester
This class is capable of checking whether a given conditional knowledge base
is consistent by searching for the root of some equivalent multi-dimensional function.
|
Modifier and Type | Class and Description |
---|---|
class |
LingelingSolver
A wrapper for the Lingeling SAT solver
(tested with Lingeling version ats1 ce8c04fc97ef07cf279c0c5dcbbc7c5d9904230a).
|
class |
MarcoMusEnumerator
Implements a MUs enumerator based on MARCO (http://sun.iwu.edu/~mliffito/marco/).
|
class |
MimusMusEnumerator
Implements a MUs enumerator based on MIMUS (http://www.cs.qub.ac.uk/~kmcareavey01/mimus.html).
|
class |
PlMusEnumerator
This abstract class models a MUS enumerator for propositional logic, i.e.
|
class |
Sat4jSolver
Uses the Sat4j library for SAT solving (note that currently only the light version is used).
|
class |
SatSolver
Abstract class for specifying SAT solvers.
|