Learnability of description logic programs

DOI10.1007/3-540-36468-4_8MaRDI QIDQ4413487zbMATH OpenFDO

Authors Jörg-Uwe Kietz

Publication date 20 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2583/25830117.htm

Mathematics Subject Classification ID

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

Recommendations

• Towards learning in CARIN-\({\mathcal {ALN}}\)
• Combining Horn rules and description logics in CARIN
• The learnability of description logics with equality constraints
• DLP learning from uncertain data
• Learning with feature description logics

Cited in

(10)

• Introducing possibilistic logic in ILP for dealing with exceptions
• Combining Horn rules and description logics in CARIN
• Learning any memory-less discrete semantics for dynamical systems represented by logic programs
• Learning description logic axioms from discrete probability distributions over description graphs
• Improving inductive logic programming by using simulated annealing
• Learning in Description Logics with Fuzzy Concrete Domains
• DL-FOIL Concept Learning in Description Logics
• Foundations of Onto-Relational Learning
• Towards learning in CARIN-\({\mathcal {ALN}}\)
• On the Complexity of Learning Description Logic Ontologies

This page was built for publication: Learnability of description logic programs

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