37 cerr <<
"You shouldn't be looking for lemmata with an empty clause" << endl;
40 size_t lemmata_index = 0;
60 cerr <<
"You shouldn't be looking for lemmata with an empty clause" << endl;
65 size_t lemmata_index = 0;
67 if (lit1.subbed_equal(&lit2)) {
83 return vector_to_string(
ls, subbed,
"[ ",
" ]",
", ");
88 string s (
"\\textcolor{cyan}{[ }");
90 s += l.make_LaTeX(subbed);
93 s +=
"\\textcolor{cyan}{]}";
97ostream& operator<<(ostream& out,
const Lemmata& l) {
98 out <<
"Lemmata:" << endl;
99 out <<
"--------" << endl;
Representation of clauses.
size_t size() const
Straightforward get method.
Representation of the lemma list.
string make_LaTeX(bool=false) const
void find_initial_lemmata(vector< InferenceItem > &, Clause &)
Find all lemmata that are applicable, but only for the initial Literal in a Clause.
void find_all_lemmata(vector< InferenceItem > &, Clause &)
Find all lemmata that are applicable, given a Clause.
vector< Literal > ls
Lemmata list as appearing in the connection calculus.
string to_string(bool=false) const
Convert to a string.
void push_back(const Literal &)
Self-explanatory.
Basic representation of literals, bundling together (pointers to) a Predicate, a collection of argume...
bool subbed_equal(Literal *) const
Equality, taking account of substitutions.
Simple function object for putting commas in lists.
Full representation of inferences, beyond just the name.