This interface defines base methods every element of a program has to provide.
This interface defines common functionality for an ELP literal.
This class represents an aggregate function.
This class implements the Arithmetic semantic given by the DLV Manual.
This class implements comparative predicates as described in the DLV manual.
This class models an atom, which is a basic structure for building literals and rules for logic programs.
This class acts as an abstract base class for classes that implement the ELPElement interface.
This formula represents the head of an disjunctive rule which is a disjunction of ELP literals.
This class models strict negation for atoms.
This class models a default negated literal.
This class models a predicate with its name and arity.
This class models a list term that can be used for DLV complex programs.
Encapsulates the possible values for a DLV complex list.
This class models an disjunctive logical program, which is a collection of rules.
This class models a rule for a disjunctive logic program.
This class models a set term, which can be used for sets in DLV complex programs.
This class is used to store symbolic sets of aggregate functions of DLV rules.