On Generalization and Subsumption for Ordered Clauses

13 years 10 months ago

Download www.mickey.ai.kyutech.ac.jp

: In this paper, we introduce ordered clauses as deﬁned 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 deﬁnition that a clause is a set of literals is inessential for the intractability of subsumption problem for clauses.

Megumi Kuwabara, Takeshi Ogawa, Kouichi Hirata, Ma

Real-time Traffic

JSAI 2005 | Show | Subsumption Problem |

claim paper

» Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in FirstOrder Logic

» Strict Basic Superposition

» A Logical Framework for Graph Theoretical Decision Tree Learning

» Recognizing Unnecessary Inference

» Towards Understanding and Harnessing the Potential of Clause Learning

» On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching

» Least Generalization under Relative Implication

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	JSAI
Authors	Megumi Kuwabara, Takeshi Ogawa, Kouichi Hirata, Masateru Harao

Comments (0)

Sciweavers

On Generalization and Subsumption for Ordered Clauses

JSAI 2005 | Show | Subsumption Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers