All Classes and Interfaces
Class
Description
AllVariableTermTypeCriteria that interprets any term name as variable
Implementation of a logic Atom.
Service that returns a copy of the logicSchema where every normal clause (logic constraint, or derivation rule) has
its body sorted according to the following order: 1) positive literals, 2) negated literals, 3) built-in literals.
Specification of a body of a normal clause.
Implementation of BooleanBuiltInLiteral constants TRUE(), and FALSE()
Implementation of a logic built-in literal.
Specification of a built-in literal.
Implementation of the logic ComparisonBuiltInLiteral.
Implementation of binary arithmetic comparison operators such as <, or <=.Implementation of a logic constant.
Specification of a logic constant.
Interface responsible for obtaining a constraint ID for a given LogicConstraintSpec
Implementation of non-standard built-in literals.
A pipeline of DependencyProcesses.
A dependency schema bounds several predicates and dependencies together guaranteeing their consistency.
Builder that creates a DependencySchema given progressive info of a DependencySchema.
Factory that creates a DependencySchema given a DependencySchemaSpec.
Specification of a whole dependency schema, that is, a specification of a set of predicates,
dependencies.
Specification of a Dependency.
Implementation of a logic derivation rule.
Specification of a derivation rule.
Builder to facilitate the creation of DerivationRuleSpec.
Equality-Generating Dependency
Specification of a logic constraint including an ID for it.
This class is responsible for removing, when it is possible, the equality built-in literals from the body of
a normal clause and apply a substitution that corresponds to such built-in literals.
Homomorphism finder that considers two derived ordinary literals to be homomorphic, even whey they have different
predicate names, if they have homomorphic derivation rules.
Class that stores the functionalDependency encoded by some egdList
Under this criteria, two derived ordinary literals are considered homomorphic, even if they have different predicate names,
if their derivation rules are homomorphic
This class is responsible for detecting whether two list of literals (or derivation rules, or logic constraints) are
logically equivalent, or not.
This class is responsible for checking whether there is an homomorphism between two NormalClauses.
An immutable list of atoms
An immutable list of literals.
An immutable list of terms
Incremental strategy for obtaining the IDs of newly created logic constraints.
Class to recognize whether two list of literals (or derivation rules, or logic constraints, or queries) are
isomorphic.
Set of predicates of a level in some hierarchical database
This class implements the definition of hierarchical database as defined in "Basis for Deductive Database Systems"
by J.
Implementation of the logic literal.
Specification of a Literal.
Implementation of a logic constraint.
Specification of a LogicConstraint.
Specification of a logic constraint including an ID for it.
Builder to facilitate the creation of LogicConstraintWithIDs.
Specification of a logic constraint with no ID.
Builder to facilitate the creation of LogicConstraintWithoutIDs.
A process that, given a logic schema, returns a new logic schema.
A pipeline of LogicProcesses.
This class implements the representation of a logic schema.
Builder for a logic schema.
Class responsible for creating a logic schema for a given logic schema specification.
Specification of a whole logic schema, that is, a specification of a set of predicates,
logic constraints, and derivation rules.
Class with static functions to find Most General Unifier between
literals, and atoms.
Interface for generating several constraintIDs from a single constraintID.
Mutable implementation of a logic predicate.
Utils class for generating new Variables.
Implementation of a logic normal clause.
Specification of a NormalClause.
Common part of the LogicConstraintSpec and DerivationRuleSpec builders
Implementation of a logic OrdinaryLiteral.
Specification of an ordinary literal.
Representation of a logic predicate.
Service that removes all those predicates (base or derived) that are not used in any LogicConstraint (neither
directly, neither transitively)
Specification of a predicate.
A Query is composed of a list of terms, and a body
E.g.: (x,y) :- P(x, y), not(R(x))
Queries can be used to define DerivedPredicates.
Specification of a set of conjunctive queries.
Specification of a conjunctive query.
Under this strategy, two ordinary literals are considered homomorphic if they have the same name,
and their terms are homomorphic.
This class is responsible to recall which constraintsID (from one schema) comes from what constraintID (from an
original schema) when applying a logic process
Class that remembers the transformation applied from an original LogicSchema to a transformedLogicSchema.
A process that, given a logic schema, returns a new schema transformation.
A pipeline of SchemaTransformationProcessPipeline.
This class is responsible for recursively unfolding the positive derived literals of a logic schema.
This class is in charge of transforming one logic schema into an equivalent logic schema where every derived
predicate is defined, only, through one derivation rule.
Process to create an equivalent DependencySchema where each TGD only contains one rule in its head
This class is the responsible to make the marking of literal positions of the TGDs
according to the 2010 25th Annual IEEE Symposium on Logic in Computer Science paper
"Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for
New Applications"
Factory in charge of instantiating the corresponding subclass of Term (Constant, or Variable)
for a given String.
This class represents a substitution of variables to terms.
Strategy for creating new constraintID from a given constraintID based on applying a suffix "_number".
Implementation of a logic Term.
Specification of a term.
Factory in charge of creating the corresponding subclass of Term for a given subclass of TermSpec
Tuple-Generating Dependency
Specification of a derivation rule.
This class is responsible for removing the trivial literals from the logic constraints, and logic derivation
rules, but without removing derived predicates, neither removing constraints.
Strategy for obtaining the ID of a new logic constraint consisting in taking the id from its specification
Implementation of a logic variable.
Specification of a variable.