On Generalization and Subsumption for Ordered Clauses

@inproceedings{Kuwabara2005OnGA,
  title={On Generalization and Subsumption for Ordered Clauses},
  author={Megumi Kuwabara and Takeshi Ogawa and Kouichi Hirata and Masateru Harao},
  booktitle={JSAI Workshops},
  year={2005}
}
In this paper, we introduce ordered clauses as defined a sequence of literals, and investigate the properties of generalizations for ordered clauses. Furthermore, we show that the subsumption problem for ordered clauses is NP-complete, as similar as the subsumption problem for ordinal clauses. Hence, the definition that a clause is a set of literals is inessential for the intractability of subsumption problem for clauses. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Efficient Theta-Subsumption Based on Graph Algorithms

Inductive Logic Programming Workshop • 1996
View 4 Excerpts
Highly Influenced

Marriot: Unification revisited

J.-L. Lassez, L.M.J. Maher
J. Minker (ed.): Foundations of deductive databases and logic programming, Morgan-Kaufmann, • 1988
View 12 Excerpts
Highly Influenced

Plotkin: A note on inductive generalization

G D.
Machine Intelligence • 1970
View 4 Excerpts
Highly Influenced

Lübbe: An efficient subsumption algorithm for inductive logic programming

M.J.-U. Kietz
Proc. 11th ICML, • 1994
View 1 Excerpt

Unifica - tion revisited

M. J. Maher, L. Marriot
1994

Fermüller : Removing redundancy from a clause

C. G. G. Gottlob
Artificial Intelligence • 1992

Similar Papers

Loading similar papers…