On Generalization and Subsumption for Ordered Clauses

: 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. 

• Type: Conference
• Year: 2005
• Where: JSAI
• Authors: Megumi Kuwabara, Takeshi Ogawa, Kouichi Hirata, Masateru Harao
• Keywords: JSAI 2005, Show, Subsumption Problem