On Generalization and Subsumption for Ordered Clauses

DOI10.1007/11780496_24zbMath1227.68104OpenAlexW1485509858MaRDI QIDQ3617035

Megumi Kuwabara, Masateru Harao, Takeshi Ogawa, Kouichi Hirata

Publication date: 26 March 2009

Published in: New Frontiers in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780496_24

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (1)

The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause

Uses Software

• SeqLog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Removing redundancy from a clause
• Foundations of inductive logic programming
• Conjunctive query containment revisited
• Database Support for Data Mining Applications

This page was built for publication: On Generalization and Subsumption for Ordered Clauses