Learnability of simply-moded logic programs from entailment

DOI10.1007/978-3-540-30502-6_9MaRDI QIDQ5463967zbMATH OpenOpenAlexFDO

Authors M. R. K. Krishna Rao

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Polynomial-time learnability of logic programs with local variables from entailment
• Some classes of Prolog programs inferable from positive data
• scientific article; zbMATH DE number 1149414
• A framework for incremental learning of logic programs
• Learning in logic with RichProlog

Cited in

(9)

• Learning any memory-less discrete semantics for dynamical systems represented by logic programs
• Learning efficient logic programs
• Parameterized logic programs where computing meets learning
• scientific article; zbMATH DE number 1149404 (Why is no real title available?)
• scientific article; zbMATH DE number 1149414 (Why is no real title available?)
• Pac-learning non-recursive Prolog clauses
• Learning logic programs with structured background knowledge
• Polynomial-time learnability of logic programs with local variables from entailment
• Incremental learning of logic programs

This page was built for publication: Learnability of simply-moded logic programs from entailment

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