Learning closed Horn expressions

DOI10.1016/S0890-5401(02)93162-7zbMath1012.68151MaRDI QIDQ1854564

Roni Khardon, Marta Arias

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (8)

On the non-efficient PAC learnability of conjunctive queries ⋮ Construction and learnability of canonical Horn formulas ⋮ Complexity parameters for first order classes ⋮ Polynomial certificates for propositional classes ⋮ Unnamed Item ⋮ Learning conditional preference networks ⋮ Unnamed Item ⋮ The subsumption lattice and query learning

Uses Software

• GOLEM

Cites Work

• Foundations of inductive logic programming
• Learning function-free Horn expressions
• Learning action strategies for planning domains
• Inductive Logic Programming: Theory and methods
• How many queries are needed to learn?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning closed Horn expressions