Polynomial-time learnability of logic programs with local variables from entailment

DOI10.1016/S0304-3975(00)00270-XMaRDI QIDQ5958645zbMATH OpenFDO

Authors M. R. K. Krishna Rao, A. Sattar

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00270-X

zbMATH Keywords

exact learningincremental learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• A framework for incremental learning of logic programs
• scientific article; zbMATH DE number 1692890
• scientific article; zbMATH DE number 1149414
• Learning logic programs with structured background knowledge

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 1104356 (Why is no real title available?)
• scientific article; zbMATH DE number 788036 (Why is no real title available?)
• Inductive Logic Programming: Theory and methods
• Queries and concept learning

Cited in

(5)

• Learning efficient logic programs
• scientific article; zbMATH DE number 1149414 (Why is no real title available?)
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• Polynomial-time computation via local inference relations
• Incremental learning of logic programs

This page was built for publication: Polynomial-time learnability of logic programs with local variables from entailment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958645)