Name
Abstract | ||
|---|---|---|
CF-induction is a sound and complete procedure for finding hypotheses in full clausal theories. It is based on the principle of Inverse Entailment (IE), and consists of two procedures: construction of a bridge theory and generalization of it. There are two possible ways to realize the generalization task in CF-induction. One uses a single deductive operator, called γ-operator, and the other uses a recently proposed form of inverse subsumption. Whereas both are known to retain the completeness of CF-induction, their logical relationship and empirical features have not been clarified yet. In this paper, we show their equivalence property and clarify the difference on their search strategies, which often leads to significant features on their obtained hypotheses. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-31951-8_31 | ILP |
Keywords | Field | DocType |
single deductive operator,full clausal theory,inverse subsumption,bridge theory,logical relationship,downward generalization,empirical feature,generalization task,inverse entailment,equivalence property,complete procedure | Inverse,Discrete mathematics,Logical consequence,Algebra,Generalization,Computer science,Theoretical computer science,Equivalence (measure theory),Operator (computer programming),Completeness (statistics) | Conference |
Citations | PageRank | References |
1 | 0.36 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoshitaka Yamamoto | 1 | 29 | 7.50 |
| Katsumi Inoue | 2 | 1271 | 112.78 |
| Koji Iwanuma | 3 | 138 | 17.65 |