Entry points
The predicates a theory is queried with, and what they rely on.
| Module | Predicates | Description |
|---|---|---|
| arg2p | 11 | The entry points of arg2p (module arg2p, loaded by every solver): the labels of the statements of the theory, of the whole graph or of a query |
| utils | 17 | Utilities on lists and on the labels of the context (module utils), most of them native primitives |
| debug | 4 | The output of the labellings (module debug): printed by buildLabelSets/0, and written when the debug switch is on |
| interpreter | 5 | A meta-interpreter tracing the facts a proof relies on (module interpreter), written for the CrossJustice project: the facts of the user, user_fact(Fact), a goal is proved with |
| module | 1 | Goals solved on the theories of external modules (module module): Prolog files, found in the modules path (flag modulesPath) by their name, or at a location |