3 search results - page 1 / 1 » On Condensation of a Clause |
ILP
2003
Springer
13 years 10 months ago
2003
Springer
In this paper, we investigate condensation of a clause. First, we extend a substitution graph introduced by Scheffer et al. (1996) to a total matcher graph. Then, we give a correc...
JAR
1998
13 years 4 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
KR
2004
Springer
13 years 10 months ago
2004
Springer
When mining frequent Datalog queries, many queries will be equivalent in the light of an implicit or explicit background knowledge. To alleviate the problem, we introduce various t...