Thrown if Extended Herbrand Sequent is unprovable.
Thrown if Extended Herbrand Sequent is unprovable. In theory this does not happen. In practice it does happen if the method used for searching a proof covers a too weak theory (e.g. no equality) or is not complete.
A generalized delta table whose rows contains the results of Delta_G(...) instead of Delta(...).
A generalized delta table whose rows contains the results of Delta_G(...) instead of Delta(...).
A generalized delta table contains decompositions for subsets of a termset and one can extract grammars from it by simply iterating through its rows.
For details, see "Algorithmic Introduction of Quantified Cuts (Hetzl et al 2013)" and deltavector.tex/.pdf in the /doc-directory.
Represents the vector Delta(t_1,...,t_n), i.e.
Represents the vector Delta(t_1,...,t_n), i.e. one row of the Delta-table (for details, see gapt/doc/deltavector.tex, Chapter "Generalized Delta-Vector").
A delta-vector computes the common structure and the differences between the terms of a termset. This is realized by returning a set of tuples (u,S), where u is a term containing the parts common to all supplied terms. It contains numbered eigenvariables where the terms diverged. S is a list of lists (one list for each introduced eigenvariable), which contains the lists of different terms which must be substituted for the eigenvariables to get the original termset.
Each member of the returned set is a valid decomposition, though, depending on the kind of delta vector, this set may contain 0, 1, or many elements.
(Since version 2015-07-01) Use InstanceTermEncoding instead.
Takes a set of terms and, using DeltaG, computes the set of smallest grammars that generate it.
Contains the implementations for the various delta-vectors.
(Since version 2015-07-01) Use InstanceTermEncoding instead.