Algorithmic Learning Theory
From MaRDI portal
Publication:5464511
DOI10.1007/b100989zbMath1110.68392OpenAlexW2583189786MaRDI QIDQ5464511
Luc De Raedt, Kristian Kersting
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100989
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17)
Related Items (13)
Learning directed probabilistic logical models: Ordering-search versus structure-search ⋮ The complexity and generality of learning answer set programs ⋮ ILP turns 20. Biography and future challenges ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Some thoughts on knowledge-enhanced machine learning ⋮ A Survey of First-Order Probabilistic Models ⋮ CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge ⋮ Learning Stochastic Logical Automaton ⋮ Generalized ordering-search for learning directed probabilistic logical models ⋮ Learning to assign degrees of belief in relational domains ⋮ Learning probabilistic logic models from probabilistic examples ⋮ Structured machine learning: the next ten years ⋮ Lifted graphical models: a survey
This page was built for publication: Algorithmic Learning Theory
